Burst tries: A fast, efficient data structure for string keys

ACM Transactions on Information Systems

Volumn 20, Issue 2, 2002, Pages 192-223

  Heinz, Steffen ^a   Zobel, Justin ^a   Williams, Hugh E ^a  

^a RMIT UNIVERSITY   (Australia)

Author keywords

Binary trees; Splay trees; String data structures; Text databases; Tries; Vocabulary accumulation

Indexed keywords

SPLAY TREES; STRING DATA STRUCTURES; TEXT DATABASES; VOCABULARY ACCUMULATION;

BINARY CODES; INDEXING (OF INFORMATION); INFORMATION MANAGEMENT; PARAMETER ESTIMATION; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

DATA STRUCTURES;

EID: 0038564328     PISSN: 10468188     EISSN: 10468188     Source Type: Journal    
DOI: 10.1145/506309.506312     Document Type: Article

References (56)

1. AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1983. Data Structures and Algorithms. Addison-Wesley, Reading, Massachusetts.
2. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers Principle Techniques and Tools. Addison-Wesley, Reading, Massachusetts.
3. AL-SUWAIYEL, M. AND HOROWITZ, E. 1984. Algorithms for trie compaction. ACM Trans. Database Syst. 9, 2, 243-263.
4. ANDERSSON, A. AND NILSSON, S. 1993. Improved behaviour of tries by adaptive branching. Information Processing Letters 46, 6 (June), 295-300.
5. AOE, J.-L, MORIMOTO, K., AND SATO, T. 1992. An efficient implementation of trie structures. Software - Practice and Experience 22, 9 (Sept.), 695-721.
6. AOE, J.-L, MORIMOTO, K., SHISHIBORI, M., AND PARK, K.-H. 1996. A trie compaction algorithm for a large set of keys. IEEE Trans. Knowl. Data Eng. 8, 3, 476-491.
7. BAEZA-YATES, R. A. AND GONNET, G. 1996. Fast text searching for regular expressions or automaton searching on tries. J. ACM 43, 6, 915-936.
8. BELL, J. AND GUPTA, G. 1993. An evaluation of self-adjusting binary search tree techniques. Software - Practice and Experience 23, 4, 369-382.
9. BELL, T. C., CLEARY, J. G., AND WITTEN, I. H. 1990. Text Compression. Prentice-Hall, Englewood Cliffs, New Jersey.
10. BENTLEY, J. AND SEDGEWICK, R. 1997. Fast algorithms for sorting and searching strings. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ACM/SIAM, New Orleans, Louisiana, 360-369.
11. CLEMENT, J., FLAJOLET, P., AND VALLÉE, B. 1998. The analysis of hybrid trie structures. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. ACM/SIAM, San Francisco, California, 531-539.
12. CLEMENT, J., FLAJOLET, P., AND VALLÉE, B. 2001. Dynamic sources in information theory: A general analysis of trie structures. Algorithmica 29, 1/2, 307-369.
13. COMER, D. 1979. Heuristics for trie minimization. ACM Trans. Database Syst. 4, 3 (Sept.), 383-395.
14. COMER, D. 1981. Analysis of a heuristic for trie minimization. ACM Trans. Database Syst. 6, 3, 513-537.
15. COMER, D. AND SETHI, R. 1977. The complexity of trie index construction. J. ACM 24, 3 (July), 428-440.
16. DE LA BRIANDAIS, R. 1959. File searching using variable length keys. In Proceedings of the Western Joint Computer Conference. Vol. 15. AFIPS Press, Montvale, NJ, USA.
17. DEVROYE, L. 1992. A study of trie-like structures under the density model. Annals of Applied Probability 2, 2,402-434.
18. FAGIN, R., NIEVERGELT, J., PIPPENGER, N., AND STRONG, H. R. 1979. Extendible hashing - a fast access method for dynamic files. ACM Trans. Database Syst. 4, 3, 315-344.
19. FLAJOLET, P. 1983. On the performance evaluation of extendible hashing and trie searching. Acta Informatica 20, 345-369.
20. FLAJOLET, P. AND PUECH, C. 1986. Partial match retrieval of multidimensional data. J. ACM 33, 2, 371-407.
21. FLAJOLET, P. AND SEDGEWICK, R. 1986. Digital search trees revisited. SIAM J. Comput. 15, 3, 748-767.
22. FREDKIN, E. 1960. Trie memory. Comm. ACM 3, 9 (Sept.), 490-499.
23. GONNET, G. 1984. Handbook of Algorithms and Data structures. Addison-Wesley, Reading, Massachusetts.
24. HARMAN, D. 1995. Overview of the second text retrieval conference (TREC-2). Information Processing & Management 31, 3, 271-289.
25. JACQUET, P. AND SZPANKOWSKI, W. 1991. Analysis of digital tries with Markovian dependency. IEEE Trans. Inf. Theory 37, 5 (Sept.), 1470-1475.
26. KIRSCHENHOFER, P. AND PRODINGER, H. 1986. Some further results on digital search trees. In Automata, Languages, and Programming, L. Kott, Ed. Lecture Notes in Computer Science, vol. 226. Springer-Verlag, Rennes, France, 177-185.
27. KNESSL, C. AND SZPANKOWSKI, W. 2000. A note on the asymptotic behavior of the height in b-tries for b large. Elect. J. Comb. 7, R39.
28. KNUTH, D. E. 1968. The Art of Computer Programming, Volume 1: Fundamental algorithms. Addison-Wesley, Reading, Massachusetts.
29. KNUTH, D.E. 1973. The Art of Computer Programming, Volume 3: Sorting and Searching, Second Edition. Addison-Wesley, Massachusetts.
30. MARTÍNEZ, C. AND ROURA, S. 1998. Randomized binary search trees. J. ACM 45, 2 (Mar.), 288-323.
31. MCCREIGHT, E. M. 1976. A space-economical suffix tree construction algorithm. J. ACM 23, 2, 262-271.
32. MORRISON, D. R. 1968. Patricia: a practical algorithm to retrieve information coded in alphanumeric. J. ACM 15, 4, 514-534.
33. NEVILL-MANNING, C. G. AND WITTEN, I. 1999. Protein is incompressible. In Proceedings of the IEEE Data Compression Conference, J. Storer and M. Cohn, Eds. Snowbird, Utah, 257-266.
34. NILSSON, S. AND KARLSSON, G. 1999. Ip-address lookup using LC-tries. IEEE J. Selected Areas Comm. 17, 6 (June), 1083-1092.
35. NILSSON, S. AND TIKKANEN, M. 1998. Implementing a dynamic compressed trie. In Proceedings of the Second Workshop on Algorithm Engineering (WAE '98), K. Mehlhorn, Ed. Max-Planck-Institut für Informatik, Saarbrücken, Germany, 25-36.
36. PETERSON, J. L. 1980. Computer programs for detecting and correcting spelling errors. Comm. ACM 23, 12, 676-686.
37. PURDIN, T. D. M. 1990. Compressing tries for storing dictionaries. In Proceedings of the IEEE Symposium on Applied Computing, H. Berghel, J. Talburt, and D. Roach, Eds. IEEE, Fayettville, Arkansas, 336-340.
38. RAIS, B., JACQUET, P., AND SZPANKOWSKI, W. 1993. Limiting distribution for the depth in Patricia tries. SIAM J. Discrete Math. 6, 197-213.
39. RAMAKRISHNA, M. V. AND ZOBEL, J. 1997. Performance in practice of string hashing functions. In Proceedings of the International Conference on Database Systems for Advanced Applications, R. Topor and K. Tanaka, Eds. Melbourne, Australia, 215-223.
40. RAMESH, R., BABU, A. J. G., AND KINCAID, J. P. 1989. Variable-depth trie index optimization: Theory and experimental results. ACM Trans. Database Syst. 14, 1, 41-74.
41. REGNIER, M. AND JACQUET, P. 1989. New results of the size of tries. IEEE Trans. Inf. Theory 35, 1 (Jan.), 203-205.
42. RIVEST, R. L. 1976. Partial match retrieval algorithms. SIAM J. Comput. 5, 1, 19-50.
43. SEVERANCE, D. G. 1974. Identifier search mechanisms: A survey and generalized model. Computing Surveys 6, 3, 175-194.
44. SLEATOR, D. AND TARJAN, R. 1985a. Amortized efficiency of list update and paging rules. Comm. ACM 28, 2 (Feb.), 202-208.
45. SLEATOR, D. AND TARJAN, R. 1985b. Self-adjusting binary search trees. J. ACM 32, 652-686.
46. SUSSENGUTH, E. 1963. Use of tree structures for processing files. Comm. ACM 6, 5, 272-279.
47. SZPANKOWSKI, W. 1990. Patricia tries again revisited. J. ACM 37, 4, 691-711.
48. SZPANKOWSKI, W. 1991. On the height of digital trees and related problems. Algorithmica 6, 256-277.
49. SZPANKOWSKI, W. 2001. Average case analysis of algorithms on sequences. John Wiley and Sons, New York.
50. UITDENBOGERD, A. L. AND ZOBEL, J. 1999. Melodic matching techniques for large music databases. In Proceedings of the ACM International Multimedia Conference, D. Bulterman, K. Jeffay, and H. J. Zhang, Eds. Orlando, Florida, 57-66.
51. WILLIAMS, H. E. AND ZOBEL, J. 2002. Indexing and retrieval for genomic databases. IEEE Trans. Knowl. Data Eng. 14, 1, 63-78.
52. WILLIAMS, H. E. AND ZOBEL, J. 2001. Searchable words on the web.
53. WILLIAMS, H. E., ZOBEL, J., AND HEINZ, S. 2001. Splay trees in practice for large text collections. Software - Practice and Experience.
54. WITTEN, I. H. AND BELL, T. C. 1990. Source models for natural language text. Int. J. Man Mach. Studies 32, 545-579.
55. WITTEN, I. H., MOFFAT, A., AND BELL, T. C. 1999. Managing Gigabytes: Compressing and Indexing Documents and Images, Second ed. Morgan Kaufmann, San Francisco, California.
56. ZOBEL, J., HEINZ, S., AND WILLIAMS, H. E. 2001. In-memory hash tables for accumulating text vocabularies. Information Processing Letters 6, 271-277.