reviewACM Computing SurveysApr 9, 2007Closed access

Compressed full-text indexes

University of Chile · University of Helsinki

Indexed incrossref

Abstract

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 indexes that exploit the compressibility of the text, so that their size is a function of the compressed text length. This concept has evolved into self-indexes , which in addition contain enough information to reproduce any text portion, so they replace the text. The exciting possibility of an index that takes space close to that of the compressed text, replaces it, and in addition provides fast search over it, has triggered a wealth of activity and produced surprising results in a very short time, which radically changed…

Citation impact

772
total citations
FWCI
98.30
Percentile
100%
References
143
Citations per year

Authors

2

Topics & keywords

Keywords
  • Substring
  • Computer science
  • Exploit
  • Index (typography)
  • Space (punctuation)
  • Entropy (arrow of time)
  • Full text search
  • Algorithm
No related works found for this paper.