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 …

Compact data structures help represent data in reduced space while allowing it to be
queried, navigated, and operated in compressed form. They are essential tools for efficiently …

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 …

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 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 …

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

Fast construction of wavelet trees - ScienceDirect Skip to main contentSkip to article
Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

Fischer and Heun [SICOMP 2011] proposed the first Range Minimum Query (RMQ) data
structure on an array A [1, n] that uses 2 n+ o (n) bits and answers queries in O (1) time …

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 …

Binary relations are an important abstraction arising in many data representation problems.
The data structures proposed so far to represent them support just a few basic operations …