Compression, Indexing, and Retrieval for Massive String Data

The field of compressed data structures seeks to achieve fast search time, but using a compressed representation, ideally requiring less space than that occupied by the original input data. The challenge is to construct a compressed representation that provides the same functionality and speed as traditional data structures. In this invited presentation, we discuss some breakthroughs in compressed data structures over the course of the last decade that have significantly reduced the space requirements for fast text and document indexing. One interesting consequence is that, for the first time, we can construct data structures for text indexing that are competitive in time and space with the well-known technique of inverted indexes, but that provide more general search capabilities. Several challenges remain, and we focus in this presentation on two in particular: building I/O-efficient search structures when the input data are so massive that external memory must be used, and incorp...

• Type: Conference
• Year: 2010
• Where: CPM
• Authors: Wing-Kai Hon, Rahul Shah, Jeffrey Scott Vitter
• Keywords: Compressed Data Structures, Compressed Representation, CPM 2010, Data Structures