The primary goal of this article is to survey state-of-the-art indexing methods for approximate
dictionary searching. To improve understanding of the field, we introduce a taxonomy that …

Modern computers typically make use of 64‐bit words as the fundamental unit of data
access. However the decade‐long migration from 32‐bit architectures has not been …

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

Search engines are exceptionally important tools for accessing information in today's world.
In satisfying the information needs of millions of users, the effectiveness (the quality of the …

Conjunctive Boolean queries are a key component of modern information retrieval systems,
especially when Web-scale repositories are being searched. A conjunctive query q is …

Set intersection is a fundamental operation in information retrieval and database systems.
This paper introduces linear space data structures to represent sets such that their …

Ordered (key-value) maps are an important and widely-used data type for large-scale data
processing frameworks. Beyond simple search, insertion and deletion, more advanced …

Major web search engines answer thousands of queries per second requesting information
about billions of web pages. The data sizes and query loads are growing at an exponential …

In this paper, we focus on sorted-set intersection which is an important part in many
algorithms, eg, RID-list intersection, inverted indexes, and others. In contrast to traditional …

In this paper we present a new problem, the fast set intersection problem, which is to
preprocess a collection of sets in order to efficiently report the intersection of any two sets in …