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 …

The wavelet tree is a versatile data structure that serves a number of purposes, from string
processing to computational geometry. It can be regarded as a device that represents a …

Wavelet trees are widely used in the representation of sequences, permutations, text
collections, binary relations, discrete points, and other succinct data structures. We show …

The wavelet tree is a flexible data structure that permits representing sequences S [1, n] of
symbols over an alphabet of size σ, within compressed space and supporting a wide range …

We introduce the first grammar-compressed representation of a sequence that supports
searches in time that depends only logarithmically on the size of the grammar. Given a text T …

We describe a data structure that supports access, rank, and select queries, as well as
symbol insertions and deletions, on a string S 1, n over alphabet 1..σ in time …

We revisit column-oriented storage and query processing techniques in the context of
contemporary graph database management systems (GDBMSs). Similar to column-oriented …

Recent advances in biotechnology and web technology are continuously generating huge
collections of similar strings. People now face the problem of storing them compactly while …

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 …

We consider various data-analysis queries on two-dimensional points. We give new
space/time tradeoffs over previous work on geometric queries such as dominance and …