Two decades ago, a breakthrough in indexing string collections made it possible to
represent them within their compressed space while at the same time offering indexed …

Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …

We address the issue of compressing and indexing data. We devise a data structure whose
space occupancy is a function of the entropy of the underlying data set. We call the data …

We design two compressed data structures for the full-text indexing problem that support
efficient substring searches using roughly the space required for storing the text in …

Entity resolution (ER) is a significant task in data integration, which aims to detect all entity
profiles that correspond to the same real-world entity. Due to its inherently quadratic …

The proliferation of online text, such as on the World Wide Web and in databases, motivates
the need for space-efficient index methods that support fast search. Consider a text T of n …

The book is intended for lectures on string processes and pattern matching in Master's
courses of computer science and software engineering curricula. The details of algorithms …

We consider the problem of indexing high-dimensional data for answering (approximate)
similarity-search queries. Similarity indexes prove to be important in a wide variety of …

Data sets in large applications are often too massive to fit completely inside the computers
internal memory. The resulting input/output communication (or I/O) between fast internal …

Suffix trees and suffix arrays are widely used and largely interchangeable index structures
on strings and sequences. Practitioners prefer suffix arrays due to their simplicity and space …