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 …

Forcing all IP packets to carry correct source addresses can greatly help network security,
attack tracing, and network problem debugging. However, due to asymmetries in today's …

We present an indexing scheme that supports worst-case optimal (wco) joins over graphs
within compact space. Supporting all possible wco joins using conventional data structures …

We propose techniques to evaluate regular path queries (RPQs) over labeled graphs (eg,
RDF). We apply a bit-parallel simulation of a Glushkov automaton representing the query …

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 a time-and space-efficient technique to solve regular path queries over
labeled (RDF) graphs. We combine a bit-parallel simulation of the Glushkov automaton of …

Sequence representations supporting the queries access, select, and rank are at the core of
many data structures. There is a considerable gap between the various upper bounds and …

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 …