On using conditional rotations and randomized heuristics for self-organizing ternary search tries

Proceedings of the Annual Southeast Conference

Volumn 1, Issue , 2005, Pages 1109-1115

  Badr, G ^a   Oommen, B J ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE SCHEME; ADAPTIVE STRATEGY; APRIORI; BINARY SEARCH TREES; DYNAMIC DICTIONARIES; RANDOMIZED HEURISTICS; RETRIEVAL TIME; SELF ORGANIZING; SELF-ORGANIZING SCHEME; TERNARY SEARCH TRIE; TEXTUAL DATA; TIME INVARIANTS;

MACHINERY; ROTATION;

BINARY TREES;

EID: 77953775186     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1167350.1167389     Document Type: Conference Paper

References (26)

1. A. Acharya, H. Zhu, and K. Shen. Adaptive algorithms for cache-efficient trie search. ACM and SIAM Workshop on Algorithm Engineering and Experimentation, January 1999.
2. S. Albers and J. Westbrook. Self-organizing data structures. Amos Fiat and Gerhard Woeginger, editors, Online Algorithms: The State of the Art, Springer-Verlag, pages 31-51, 1998.
3. B. Allen and I. Munro. Self-organizing binary search trees. J. ACM, 25:526-535, 1978.
4. A. Andersson. General balanced trees. Journal of Algorithms, 30:1-28, 1999.
5. A. Andersson and S. Nilsson. Improved behaviour of tries by adaptive branching. Information Processing Letters, 46(6):296-300, June 1993.
6. J. Aoe, K. Morimoto, and T. Sato. An efficient implementation of trie structures. Software-Practice and Experience, 22(9):695-721, 1992.
7. C. Aragon and R. Seidel. Randomized search trees. Proc. 30th Symp. on Foundations of Computer Science, pages 540-545, 1989.
8. G. Badr and B. J. Oommen. Self-adjusting of ternary search tries using conditional rotations and randomized heuristics. To Appear in Computer Journal 2004.
9. P. Bagwell. Fast and space efficient trie searches. Technical report, 2000/334, Ecole Polytechnique Fédérale de Lausanne, March 2000.
10. P. Bagwell. Ideal hash trees. Technical report, October 2001.
11. P. J. Bayer. Improved bounds on the costs of optimal and balanced binary search trees. MAC Technical Memo, 69, Nov. 1975.
12. J. Bentley and R. Sedgewick. Fast algorithms for sorting and searching strings. Eighth Annual ACM-SIAM Symposium on Discrete Algorithms New Orleans, January 1997.
13. J. Bentley and R. Sedgewick. Ternary search trees. Dr. Dobb's Journal, 1998.
14. J.R. Bitner. Heuristics that dynamically organize data structures. SIAM J. Comput, 8:82-110, 1979.
15. R. Brandais. File searching using variable length keys. In Proceedings of Western Joint Computer Conference, 15:295-298, 1959.
16. L. Devroye. Applications of the theory of records in the study of random trees. Acta Informatica, 26:123-130, 1988.
17. E. Fredkin. Trie memory. Communication of the ACM, 3:490-499, 1960.
18. I. Galperin and R.L. Rivest. Scapegoat trees. Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms, Austin, Texas, United States, pages 165-174, 1993.
19. S. Heinz, J. Zobel, and H. Williams. Burst tries: A fast, efficient data structure for string keys. ACM Transactions on Information Systems, 20(2):192-223, 2002.
20. P. Flajolet, J. Clément and B. Vallèe. The analysis of hybrid trie structures. Proc. Annual ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, pages 531-539, 1998.
21. D. R. Morrison. Patricia: a practical algorithm to retrieve information coded in alphanumeric. Journal of ACM, 15(4):514-1271, 1968.
22. B.J. Oommen, R.P. Cheethman and D.T.H. Ng. Adaptive structuring of binary search trees using conditional rotations. IEEE Transactions on knowledge and data engineering, 5(4):695-704, August 1993.
23. M. Sherk. Self adjusting k-ary search trees. Journal of Algorithms, 19(1), 1995.
24. D.D. Sleator and R.E. Tarjan. Self-adjusting binary search trees. Journal of the ACM, 32(3):652-686, 1985.
25. W. Szpankowski. Average Case Analysis of Algorithms on Sequences. John Wiley and Sons, New York, 2001.
26. I. H. Witten and T. C. Bell. Source models for natural language text. International Journal on Man Machine Studies, 32:545-579, 1990.