The data structure at the core of large-scale search engines is the inverted index, which is
essentially a collection of sorted integer sequences called inverted lists. Because of the …

Motivation A dictionary of k-mers is a data structure that stores a set of n distinct k-mers and
supports membership queries. This data structure is at the hearth of many important tasks in …

The problem of sequence identification or matching—determining the subset of reference
sequences from a given collection that are likely to contain a short, queried nucleotide …

We address the problem of designing, implementing, and experimenting with compressed
data structures that support rank and select queries over a dictionary of integers. We shine a …

We consider the problem of representing a set of k-mers and their abundance counts, or
weights, in compressed space so that assessing membership and retrieving the weight of ak …

We address the well-known problem of designing, implementing and experimenting
compressed data structures for supporting rank and select queries over a dictionary of …

Web connectivity graphs and similar linked data such as inverted indexes are important
components of the information access systems provided by social media and web search …

As an important threat to public security, urban fire accident causes huge economic loss and
catastrophic collapse. Predicting and analyzing the interior rule of urban fire accident from its …

Dictionary-based compression schemes provide fast decoding operation, typically at the
expense of reduced compression effectiveness compared to statistical or probability-based …

We examine approaches used for block-based inverted index compression, such as the
OptPFOR mechanism, in which fixed-length blocks of postings data are compressed …