Skip to main content
SpringerLink
Log in
Book cover

European Symposium on Algorithms

ESA 1994: Algorithms — ESA '94 pp 82–93Cite as

Faster searching in tries and quadtrees—An analysis of level compression

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 855))

Abstract

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.

Both tries and quadtrees are extensively used and much effort has been spent obtaining detailed analyses. Since the LC-trie performs significantly better than standard tries, for a large class of common distributions, while still being easy to implement, we believe that the LC-trie is a strong candidate for inclusion in the standard repertoire of basic data structures.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Amir, G. Benson, and M. Farach. Efficient pattern matching with scaling. Journal of Algorithms, 13(1), 1992.

    Google Scholar 

  2. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: pattern matching in z-compressed files. In Proc. of 5th Symposium on Discrete Algorithms, 1994.

    Google Scholar 

  3. A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Information Processing Letters, 46:295–300, 1993.

    Article  MathSciNet  Google Scholar 

  4. A. Andersson and S. Nilsson. Efficient implementation of suffix trees. Technical Report, Dept. of Computer Science, Lund University, 1994.

    Google Scholar 

  5. L. Devroye. A note on the average depth of tries. Computing, 28:367–371, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  6. T. Eilam-Tsoreff and U. Vishkin. Matching patterns in a string subject to multilinear transformation. In Proc. of the International Workshop on Sequences, Combinatorics, Compression, Security and Transmission, Salerno, Italy, June, 1988.

    Google Scholar 

  7. Ph. Flajolet. On the performace evaluation of extendible hashing and trie searching. Acta Informatica, 20:345–369, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  8. Ph. Flajolet, M. Régnier, and D. Sotteau. Algebraic methods for trie statistics. Ann. Discrete Math., 25:145–188, 1985.

    Google Scholar 

  9. E. H. Fredkin. Trie memory. Communications of the ACM, 3:490–500, 1960.

    Article  Google Scholar 

  10. G. H. Gonnet and R. Baeza-Yates. Handbook of Algorithms and Data Structures. Addison-Wesley, 1991.

    Google Scholar 

  11. T. Hagerup and C. Rüb. A guided tour of chernoff bounds. Information Processing Letters, 33(6):305–308, 1990.

    Article  MathSciNet  Google Scholar 

  12. D. A. Huffman. A method for the construction of minimum redundancy codes. In Proc. IRE, volume 40, pages 1098–1101, 1952.

    Google Scholar 

  13. P. Kirschenhofer and H. Prodinger. Some further results on digital search trees. In Proc. 13th ICALP, pages 177–185. Springer Verlag, 1986. Lecture Notes in Computer Science vol. 26.

    Google Scholar 

  14. D. E. Knuth. The Art of Computer Programming, Volume 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973.

    Google Scholar 

  15. B. Pittel. Asymptotical growth of a class of random trees. The Annals of Probability, 13(2):414–427, 1985.

    MATH  MathSciNet  Google Scholar 

  16. B. Pittel. Paths in a random digital tree: limiting distributions. Advances in Applied Probability, 18:139–155, 1986.

    MATH  MathSciNet  Google Scholar 

  17. H. Samet. The quadtree and related hierarchical data structures. Computing Surveys, 16(2):187–260, 1984.

    Article  MathSciNet  Google Scholar 

  18. E. Slud. Entropy and maximal spacings for random partitions. Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete, 41:341–352, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  19. J. van Leeuwen, editor. Handbook of Theoretical Computer Science, vol. A. Elsevier Science Publishers B.V., 1990. ISBN 0-444-88071-2.

    Google Scholar 

  20. I. H. Witten, R. M. Neal, and J. G. Cleary. Arithmetic coding for data compression. Communications of the ACM, 30(6):520–540K, 1987.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Box 118, S-22100, Lund, Sweden

    Arne Andersson & Stefan Nilsson

Authors
  1. Arne Andersson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefan Nilsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Andersson, A., Nilsson, S. (1994). Faster searching in tries and quadtrees—An analysis of level compression. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049399

Download citation

  • DOI: https://doi.org/10.1007/BFb0049399

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58434-6

  • Online ISBN: 978-3-540-48794-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation