Full-Text Indexes in External Memory

  • Juha Kärkkäinen
  • S. Srinivasa Rao
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2625)


A full-text index is a data structure storing a text (a string or a set of strings) and supporting string matching queries: Given a pattern string P, find all occurrences of P in the text. The best-known full-text index is the suffix tree [761], but numerous others have been developed. Due to their fast construction and the wealth of combinatorial information they reveal, full-text indexes (and suffix trees in particular) also have many uses beyond basic string matching. For example, the number of distinct substrings of a string or the longest common substrings of two strings can be computed in linear time [231]. Gusfield [366] describes several applications in computational biology, and many others are listed in [359].


External Memory String Match Suffix Array Euler Tour Disk Block 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Juha Kärkkäinen
    • 1
  • S. Srinivasa Rao
    • 2
  1. 1.Max-Planck Institut für InformatikSaarbrückenGermany
  2. 2.School of Computer ScienceUniversity of WaterlooWaterlooCanada

Personalised recommendations