Parallel and Distributed Compressed Indexes

Abstract. We study parallel and distributed compressed indexes. Compressed indexes are a new and functional way to index text strings. They exploit the compressibility of the text, so that their size is a function of the compressed text size. Moreover, they support a considerable amount of functions, more than many classical indexes. We make use of this extended functionality to obtain, in a shared-memory parallel machine, near-optimal speedups for solving several stringology problems. We also show how to distribute compressed indexes across several machines.

• Type: Conference
• Year: 2010
• Where: CPM
• Authors: Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira
• Keywords: Classical Indexes, CPM 2010, Index Text Strings, Shared-memory Parallel Machine