Breaking a time-and-space barrier in constructing full-text indices

SIAM Journal on Computing

Volumn 38, Issue 6, 2009, Pages 2162-2178

  Hon, Wing Kai ^a   Sadakane, Kunihiko ^b   Sung, Wing Kin ^c  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

^b KYUSHU UNIVERSITY   (Japan)

^c NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Preprocessing; Suffix arrays; Suffix trees; Text indexing

Indexed keywords

COMPRESSED SUFFIX ARRAY; CONSTRUCTION ALGORITHMS; FM-INDEX; FULL-TEXT INDEX; PAPER BREAK; PREPROCESSING; RUNNING-IN; SPACE BOUNDS; SPACE EFFICIENT ALGORITHMS; SPEED-UP; SUFFIX ARRAYS; SUFFIX TREES; SUFFIX-TREE; TEXT INDEXING; WORKING SPACE;

ALGORITHMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS;

INDEXING (OF INFORMATION);

EID: 65949095627     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/070685373     Document Type: Article

References (32)

1. P. BEAME AND F. E. FICH, Optimal bounds for the predecessor problem and related problems, J. Comput. System Sci., 65 (2002), pp. 38-72. Preliminary version appears in Proceedings of the ACM Symposium on Theory of Computing (STOC), 1999.
2. M. BURROWS AND D. J. WHEELER, A Block-Sorting Lossless Data Compression Algorithm, Technical report 124, Digital Equipment Corporation, Palo Alto, CA, 1994.
3. A. CRAUSER AND P. FERRAGINA, A theoretical and experimental study on the construction of suffix arrays in external memory, Algorithmica, 32 (2002), pp. 1-35.
4. M. FARACH, Optimal sullix tree construction with large alphabets, in Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Miami Beach, FL, 1997, pp. 137-143.
5. P. FERRAGINA AND G. MANZINI, Indexing compressed text, J. ACM, 52 (2005), pp. 552-581. Preliminary version appears in Proceedings of the IEEE Symposium on Foundations of Computer Science (FOCS), 2000.
6. R. GROSSI AND J. S. VITTER, Compressed suffix arrays and suffix trees with applications to text indexing and string matching, SIAM J. Comput., 35 (2005), pp. 378-407. Preliminary version appears in Proceedings of the ACM Symposium on Theory of Computing (STOC), 2000.
7. D. A. GROSSMAN AND O. FRIEDER, Information Retrieval: Algorithms and Heuristics, Kluwer Academic Publishers, Boston, MA, 1998.
8. D. GUSFIELD, Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology, Cambridge University Press, Cambridge, UK, 1997.
9. T. HAGERUP, Sorting and searching on the word RAM, in Proceedings of the Symposium on Theoretical Aspects of Computer Science (STACS), Springer, Berlin, 1998, pp. 366-398.
10. T. HAGERUP, P. B. MILTERSEN, AND R. PAGH, Deterministic dictionaries, J. Algorithms, 41 (2001), pp. 69-85.
11. W. K. HON, On the Construction and Application of Compressed Text Indexes, Ph.D. Thesis, University of Hong Kong, Hong Kong, 2004.
12. W. K. HON AND K. SADAKANE, Space-economical algorithms for finding maximal unique matches, in Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM), Springer, Berlin, 2002, pp. 144-152.
13. G. JACOBSON, Space-efficient static trees and graphs, in Proceedings of the ACM Symposium on Foundations of Computer Science (STOC), 1989, pp. 549-554.
14. J. KÄRKKÄINEN, P. SANDERS, AND S. BURKHARDT, Linear work suffix array construction, J. ACM, 53 (2006), pp. 918-936. Preliminary version appears in Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2003.
15. D. KIM, J. SIM, H. PARK, AND K. PARK, Constructing suffix arrays in linear time, J. Discrete Algorithms, 3 (2005), pp. 126-142. Preliminary version appears in Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM), 2003.
16. P. KO AND S. ALURU, Space efficient linear time construction of suffix arrays, J. Discrete Algorithms, 3 (2005), pp. 143-156. Preliminary version appears in Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM), 2003.
17. S. KURTZ, Reducing the space requirement of suffix trees, Software Practice and Experiences, 29 (1999), pp. 1149-1171.
18. T. W. LAM, K. SADAKANE, W. K. SUNG, AND S. M. YIU, A space and time efficient algorithm for constructing compressed suffix arrays, in Proceedings of the International Conference on Computing and Combinatorics, Springer, Berlin, 2002, pp. 401-410.
19. U. MANBER AND G. MYERS, Suffix arrays: A new method for on-line string searches, SIAM J. Comput., 22 (1993), pp. 935-948.
20. E. M. MCCREIGHT, A space-economical suffix tree construction algorithm, J. ACM, 23 (1976), pp. 262-272.
21. K. MEHLHORN, Data Structures and Algorithms 1: Sorting and Searching, Springer-Verlag, Heidelberg, Germany, 1984.
22. J. I. MUNRO, Tables, in Proceedings of the Conference on Foundations of Software Technology and Theoretical Computer Science, Springer, Berlin, 1996, pp. 37-42.
23. J. C. NA AND K. PARK, Alphabet-independent linear-time construction of compressed suffix arrays using o (n log n)-bit working space, Theoret. Comput. Sci., 385 (2007), pp. 127-136. Preliminary version appears in Proceedings of the Annual Symposium on Combinatorial Pattern Matching (CPM), 2005.
24. R. PAGH, Low redundancy in static dictionaries with constant query time, SIAM J. Comput., 31 (2001), pp. 353-363.
25. R. RAMAN, V. RAMAN, AND S. S. RAO, Succinct indexable dictionaries with applications to encoding k-ary trees and multisets, in Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM, New York, SIAM, Philadelphia, 2002, pp. 233-242.
26. K. SADAKANE, New text indexing functionalities of the compressed suffix arrays, J. Algorithms, 48 (2003), pp. 294-313. Preliminary version appears in Proceedings of the Annual International Symposium on Algorithms and Computation (ISAAC), 2000.
27. J. SEWARD, The bzip2 and libbzip2 Official Home Page, http://www.bzip.org/(2008).
28. S. SHIMOZONO, H. ARIMURA, AND S. ARIKAWA, Efficient discovery of optimal word association patterns in large text databases, New Generation Computing, 18 (2000), pp. 49-60.
29. E. UKKONEN, On-line construction of suffix trees, Algorithmica, 14 (1995), pp. 249-260.
30. P. WEINER, Linear pattern matching algorithms, in Proceedings of the 14th Annual IEEE Symposium on Switching and Automata Theory, Iowa City, IA, 1973, pp. 1-11.
31. D. E. WILLARD, Log-logarithmic worst-case range queries are possible in space tθ(N), Inform. Process. Lett., 17 (1983), pp. 81-84.
32. J. ZOBEL, A. MOFFAT, AND K. RAMAMOHANARAO, Guidelines for presentation and comparison of indexing techniques, SIGMOD Record, 25 (1996), pp. 10-15.