An experimental study of compression methods for dynamic tries

Algorithmica (New York)

Volumn 33, Issue 1, 2002, Pages 19-33

  Nilsson, S ^a   Tikkanen, M ^b  

^a ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

^b NOKIA SIEMENS NETWORKS   (Finland)

Author keywords

Binary search tree; Data structures; Java; Level compression; LPC trie; Memory management; Relaxed level compression; Trie

Indexed keywords

JAVA PROGRAMMING LANGUAGE; PROBLEM SOLVING; TREES (MATHEMATICS);

BINARY DATA;

DATA STRUCTURES;

EID: 0141991841     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0102-y     Document Type: Article

References (27)

1. A. Analyti, S. Pramanik. Fast search in main memory databases. SIGMOD Record, 21(2): 215-224, June 1992.
2. A. Andersson, S. Nilsson. Improved behaviour of tries by adaptive branching. Information Processing Letters, 46(6):295-300, 1993.
3. A. Andersson, S. Nilsson. Faster searching in tries and quadtrees - an analysis of level compression. In Proceedings of the Second Annual European Symposium on Algorithms, pages 82-93. Lecture Notes in Computer Science, vol. 855. Springer-Verlag, Berlin, 1994.
4. A. Andersson, S. Nilsson. Efficient implementation of suffix trees. Software - Practice and Experience, 25(2): 129-141, 1995.
5. J.-I. Aoe, K. Morimoto. An efficient implementation of trie structures. Software - Practice and Experience, 22(9):695-721, 1992.
6. J. L. Bentley, R. Sedgewick. Fast algorithms for sorting and searching strings. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 360-369, 1997.
7. T. H. Cormen, C. E. Leiserson, R. L. Rivest. Introduction to Algorithms. McGraw-Hill, New York, 1990.
8. J. J. Darragh, J. G. Cleary, I. H. Witten. Bonsai: a compact representation of trees. Software - Practice and Experience, 23(3):277-291, 1993.
9. L. Devroye. A note on the average depth of tries. Computing, 28(4):367-371, 1982.
10. J. A. Dundas III. Implementing dynamic minimal-prefix tries. Software -Practice and Experience, 21(10):1027-1040, 1991.
11. P. Flajolet. On the performance evaluation of extendible hashing and trie searching. Acta Informatica, 20:345-369, 1983.
12. P. Flajolet. Digital search trees revisited. SIAM Journal on Computing, 15(3):748-767, 1986.
13. P. Flajolet, M. Régnier, D. Sotteau. Algebraic methods for trie statistics. Annals of Discrete Mathematics, 25:145-188, 1985.
14. E. Fredkin. Trie memory. Communications of the ACM, 3:490-500, 1960.
15. G. H. Gonnet, R. A. Baeza-Yates. Handbook of Algorithms and Data Structures, second edition. Addison-Wesley, Reading, MA, 1991.
16. P. Kirschenhofer, H. Prodinger. Some further results on digital search trees. In Proceedings of 13th ICALP, pages 177-185. Lecture Notes in Computer Science, vol. 26. Springer-Verlag, Berlin, 1986.
17. EX: The Program. Addison-Wesley, Reading, MA, 1986.
18. D. E. Knuth. The Art of Computer Programming, vol. 3. Addison-Wesley, Reading, MA, 1973.
19. P.-A. Larson. Dynamic hash tables. Communications of the ACM, 31 (4): 446-457, 1988.
20. J. van Leeuwen. Handbook of Computer Science, vol. A. Elsevier, Amsterdam, 1990.
21. K. Morimoto, H. Iriguchi, J.-I. Aoe. A method of compressing trie structures. Software - Practice and Experience, 24(3):265-288, 1994.
22. S. Nilsson, G. Karlsson. Fast address lookup for Internet routers. In Proceedings of the 4th IFIP International Conference on Broadband Communications (BC '98). Chapman & Hall, London, 1998.
23. B. Pittel. Asymptotical growth of a class of random trees. The Annals of Probability, 13(2):414-427, 1985.
24. B. Pittel. Paths in a random digital tree: limiting distributions. Advances in Applied Probability, 18:139-155, 1986.
25. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1989.
26. R. Seidel, C. R. Aragon. Randomized binary search trees. Algorithimica, 16(4/5):464-497, 1996.
27. F. Wagner, A. Wolff. A combinatorial framework for map labeling. In Proceedings of the Symposium on Graph Drawing '98. Springer-Verlag, Berlin, 1998.