Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 176–178Cite as

Compressed Text Indexing

2005; Ferragina, Manzini

  • Reference work entry

  • 174 Accesses

Keywords and Synonyms

Space-efficient text indexing; Compressed full-text indexing; Self-indexing

Problem Definition

Given a text string \( { T = t_1 t_2 \dots t_n } \) over an alphabet Σ of size σ, the compressed text indexing (CTI) problem asks to replace T with a space-efficient data structure capable of efficiently answering basic string matching and substring queries on T. Typical queries required from such an index are the following:

  • \( { count(P) } \): count how many times a given pattern string \( { P = p_1 p_2 \dots p_m } \) occurs in T.

  • \( { locate(P) } \): return the locations where P occurs in T.

  • display(i, j): return \( { T[i,j] } \).

Key Results

An elegant solution to the problem is obtained by exploiting the connection of Burrows-Wheeler Transform (BWT) [1] and Suffix Array data structure [9]. The suffix array \( { SA[1,n] } \) of T is the permutation of text positions \( { (1 \dots n) } \) listing the suffixes \( { T[i,n] } \) in lexicographic order. That is, \( {...

Keywords

  • Suffix Array
  • Wavelet Tree
  • Text Position
  • Global Query
  • Database Scenario

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   399.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)

    Google Scholar 

  2. Ferragina, P., Giancarlo, R., Manzini, G., Sciortino, M.: Boosting textual compression in optimal linear time. J. ACM 52(4), 688–713 (2005)

    CrossRef  MathSciNet  Google Scholar 

  3. Ferragina, P. Manzini, G.: Indexing compressed texts. J. ACM 52(4), 552–581 (2005)

    CrossRef  MathSciNet  Google Scholar 

  4. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representation of sequences and full-text indexes. ACM Trans. Algorithms 3(2) Article 20 (2007)

    Google Scholar 

  5. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 841–850 (2003)

    Google Scholar 

  6. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 549–554 (1989)

    Google Scholar 

  7. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nord. J. Comput. 12(1), 40–66 (2005)

    Google Scholar 

  8. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. In: Proc. 17th Annual Symposium on Combinatorial Pattern Matching (CPM). LNCS, vol. 4009, pp. 307–318 (2006) Extended version as TR/DCC-2006-10, Department of Computer Science, University of Chile, July 2006

    Google Scholar 

  9. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22(5), 935–948 (1993)

    CrossRef  MathSciNet  MATH  Google Scholar 

  10. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. ACM 48(3), 407–430 (2001)

    CrossRef  MathSciNet  Google Scholar 

  11. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Comput. Surv. 39(1) Article 2 (2007)

    Google Scholar 

  12. Raman, R., Raman, V., Rao, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 233–242 (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Helsinki, Helsinki, Finland

    Veli Mäkinen

  2. Department of Computer Science, University of Chile, Santiago, Chile

    Gonzalo Navarro

Authors
  1. Veli Mäkinen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gonzalo Navarro
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer ScienceMcCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, 60208, USA

    Ming-Yang Kao Professor of Computer Science

Rights and permissions

Reprints and Permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

Mäkinen, V., Navarro, G. (2008). Compressed Text Indexing. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-30162-4_83

Download citation

search

Navigation