Document retrieval is one of the best-established information retrieval activities since
the'60s, pervading all search engines. Its aim is to obtain, from a collection of text …

We describe a data structure that uses O (n)-word space and reports k most relevant
documents that contain a query pattern P in optimal O (| P|+ k) time. Our construction …

Colored range queries are a well-studied topic in computational geometry and database
research that, in the past decade, have found exciting applications in information retrieval. In …

Inverted indexes are the most fundamental and widely used data structures in information
retrieval. For each unique word occurring in a document collection, the inverted index stores …

The topic of this paper is the exploration of the various characteristics of the wavelet tree
data structure, a data structure that was initially proposed for text compression applications …

The inverted index is the backbone of modern web search engines. For each word in a
collection of web documents, the index records the list of documents where this word occurs …

We give new space/time tradeoffs for compressed indexes that answer document retrieval
queries on general sequences. On a collection of D documents of total length n, current …

The spread of influence in social networks is studied in two main categories: progressive
models and non-progressive models (see, eg, the seminal work of Kempe et al.[8]). While …

Let \mathcalD be a collection of D documents, which are strings over an alphabet of size σ,
of total length n. We describe a data structure that uses linear space and reports k most …

In the orthogonal range-searching problem, we store a set of input points S in a data
structure; the answer to a query Q is a piece of information about points in Q∩ S, for …