[LLIBRE][B] Modern information retrieval
R Baeza-Yates, B Ribeiro-Neto - 1999 - people.ischool.berkeley.edu
Information retrieval (IR) has changed considerably in recent years with the expansion of the
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …
World Wide Web and the advent of modern and inexpensive graphical user interfaces and …
Learning to distribute vocabulary indexing for scalable visual search
In recent years, there is an ever-increasing research focus on Bag-of-Words based near
duplicate visual search paradigm with inverted indexing. One fundamental yet unexploited …
duplicate visual search paradigm with inverted indexing. One fundamental yet unexploited …
New caching techniques for web search engines
This paper proposes a cache hierarchy that enables Web search engines to efficiently
process user queries. The different caches in the hierarchy are used to store pieces of data …
process user queries. The different caches in the hierarchy are used to store pieces of data …
[HTML][HTML] Parallel query processing on distributed clustering indexes
Similarity search has been proved suitable for searching in large collections of unstructured
data objects. A number of practical index data structures for this purpose have been …
data objects. A number of practical index data structures for this purpose have been …
Sync/async parallel search for the efficient design and construction of web search engines
A parallel query processing method is proposed for the design and construction of web
search engines to efficiently deal with dynamic variations in query traffic. The method allows …
search engines to efficiently deal with dynamic variations in query traffic. The method allows …
Capacity planning for vertical search engines: An approach based on coloured petri nets
This paper proposes a Colored Petri Net model capturing the behaviour of vertical search
engines. In such systems a query submitted by a user goes through different stages and can …
engines. In such systems a query submitted by a user goes through different stages and can …
Distributed text search using suffix arrays
Text search is a classical problem in Computer Science, with many data-intensive
applications. For this problem, suffix arrays are among the most widely known and used data …
applications. For this problem, suffix arrays are among the most widely known and used data …
Modelling search engines performance using coloured petri nets
This paper proposes using Coloured Petri Nets to model performance of vertical search
engines for Web search. In such systems, queries submitted by users or client systems are …
engines for Web search. In such systems, queries submitted by users or client systems are …
Hybrid capacity planning methodology for web search engines
Capacity planning studies are suitable for supporting decision making in management and
operation of Web search engines deployed on large clusters of processors. Among many …
operation of Web search engines deployed on large clusters of processors. Among many …
A search engine index for multimedia content
We present a distributed index data structure and algorithms devised to support parallel
query processing of multimedia content in search engines. We present a comparative study …
query processing of multimedia content in search engines. We present a comparative study …