Faster Searching in Tries and Quadtrees - An Analysis of Level Compression

We analyze the behavior of the level-compressed trie, LC-trie, a compact version of the standard trie data structure. Based on this analysis, we argue that level compression improves the performance of both tries and quadtrees considerably in many practical situations. In particular, we show that LC-tries can be of great use for string searching in compressed text.

[1]  Arne Andersson,et al.  Efficient implementation of suffix trees , 1995, Softw. Pract. Exp..

[2]  Helmut Prodinger,et al.  Some Further Results on Digital Search Trees , 1986, ICALP.

[3]  M. V. Wilkes,et al.  The Art of Computer Programming, Volume 3, Sorting and Searching , 1974 .

[4]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[5]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[6]  Edward Fredkin,et al.  Trie memory , 1960, Commun. ACM.

[7]  Arne Andersson,et al.  Improved Behaviour of Tries by Adaptive Branching , 1993, Inf. Process. Lett..

[8]  B. Pittel.  Asymptotical Growth of a Class of Random Trees , 1985 .

[9]  E. Slud.  Entropy and maximal spacings for random partitions , 1978 .

[10]  Gaston H. Gonnet,et al.  Handbook Of Algorithms And Data Structures , 1984 .

[11]  P. Flajolet,et al.  Algebraic Methods for Trie Statistics , 1985 .

[12]  Gad M. Landau,et al.  Efficient pattern matching with scaling , 1990, SODA '90.

[13]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[14]  Gary Benson,et al.  Let sleeping files lie: pattern matching in Z-compressed files , 1994, SODA '94.

[15]  Carl A. Gunter,et al.  In handbook of theoretical computer science , 1990 .

[16]  Ian H. Witten,et al.  Arithmetic coding for data compression , 1987, CACM.

[17]  Torben Hagerup,et al.  A Guided Tour of Chernoff Bounds , 1990, Inf. Process. Lett..

[18]  H WittenIan,et al.  Arithmetic coding for data compression , 1987 .

[19]  B. Pittel.  Paths in a random digital tree: limiting distributions , 1986, Advances in Applied Probability.

[20]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.