Computer Science – Data Structures and Algorithms
Scientific paper
2007-12-20
Computer Science
Data Structures and Algorithms
Scientific paper
A compressed full-text self-index represents a text in a compressed form and still answers queries efficiently. This technology represents a breakthrough over the text indexing techniques of the previous decade, whose indexes required several times the size of the text. Although it is relatively new, this technology has matured up to a point where theoretical research is giving way to practical developments. Nonetheless this requires significant programming skills, a deep engineering effort, and a strong algorithmic background to dig into the research results. To date only isolated implementations and focused comparisons of compressed indexes have been reported, and they missed a common API, which prevented their re-use or deployment within other applications. The goal of this paper is to fill this gap. First, we present the existing implementations of compressed indexes from a practitioner's point of view. Second, we introduce the Pizza&Chili site, which offers tuned implementations and a standardized API for the most successful compressed full-text self-indexes, together with effective testbeds and scripts for their automatic validation and test. Third, we show the results of our extensive experiments on these codes with the aim of demonstrating the practical relevance of this novel and exciting technology.
Ferragina Paolo
Gonzalez Rodrigo
Navarro Gonzalo
Venturini Rossano
No associations
LandOfFree
Compressed Text Indexes:From Theory to Practice! does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Compressed Text Indexes:From Theory to Practice!, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compressed Text Indexes:From Theory to Practice! will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-2771