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 …

The representation of large subsets of the World Wide Web in the form of a directed graph
has been extensively used to analyze structure, behavior, and evolution of those so-called …

Sequencing data are rapidly accumulating in public repositories. Making this resource
accessible for interactive analysis at scale requires efficient approaches for its storage and …

The need to store and query a set of strings–a string dictionary–arises in many kinds of
applications. While classically these string dictionaries have accounted for a small share of …

Abstract The Web of Data has been gaining momentum in recent years. This leads to
increasingly publish more and more semi-structured datasets following, in many cases, the …

We introduce a compressed data structure for the storage of free trajectories of moving
objects that efficiently supports various spatio-temporal queries. Our structure, dubbed …

The new opportunities generated by the data-driven economy in the manufacturing industry
have caused many companies opt for it. However, the size of time series data that need to …

In this work, we propose a framework to store and manage spatial data, which includes new
efficient algorithms to perform operations accepting as input a raster dataset and a vector …

Compact data structures are storage structures that combine a compressed representation
of the data and the access mechanisms for retrieving individual data without the need of …

Indexing highly repetitive collections has become a relevant problem with the emergence of
large repositories of versioned documents, among other applications. These collections may …