The Complexity of Trie Index Construction

Journal of the ACM (JACM)

Volumn 24, Issue 3, 1977, Pages 428-440

  Comer, Douglas ^a,b   Sethi, Ravi ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b PURDUE UNIVERSITY   (United States)

^c LUCENT TECHNOLOGIES   (United States)

Author keywords

average search time; complexity; reformation retrieval; trle indexes; true size

Indexed keywords

INFORMATION SCIENCE;

EID: 0017512274     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/322017.322023     Document Type: Article

References (15)

1. Aho, A V., Hopcroft, J E, and Ullman, J D The Design and Analysis of Computer Algorithms Addison-Wesley, Reading, Mass, 1974.
2. Bayer, R, and McCreight, E Organization and maintenance of large ordered indices Acta Informatica 1 (1972), 173–189.
3. Comer, D E, and Sethi, R Complexity of trie index construction Extended abstract, Proc 17th Annual Symp on Foundations of Comptr Sci, Oct 1976, pp 197–207.
4. Cook. S A The complexity of theorem-proving procedures Proc Third Annual ACM Symp on Theory of Computing, May 1971, pp 151–158.
5. de la Briandais, R File searching using variable length keys Proc Western Joint Comptr Conf, IRE, New York, 1959, pp 295–298.
6. de Maine, P A D, and Rotwitt, T JR Storage optimization of tree structured files representing descriptor sets proc acm sigfidet workshop on data description, access and control, Nov 1971, pp 207–217.
7. Fredkin, E Trie memory Comm ACM 3, 9 (Sept 1960), 490–499.
8. Hyafil, L., and Rivest, R Constructing optimal binary decision trees is NP-complete Information Processing Letters 5, 1 (May 1976), 15–17.
9. Knuth, D E The Art of Computer Programming, Vol 1 Fundamental Algorithms Addison-Wesley, Reading, Mass, 1968.
10. Knuth, D E The Art of Computer Programming, Vol 3: Sorting and Searching Addison-Wesley, Reading, Mass, 1973.
11. Nievergelt, J Binary search trees and file organization Computing Surveys 6, 3 (Sept 1974), 195–207.
12. Schkolnick, M Secondary index optimization ACM-SIGMOD Int Conf on Management of Data, San Jose, Caiif, May 1975, pp. 186–192.
13. Severance, D G Identifier search mechanisms: A survey and generalized model Computing Surveys 6, 3 (Sept 1974), 175–194.
14. Sussenguth, E H Jr Use of tree structures for processing files Comm ACM 6, 5 (May 1963), 272–279.
15. Yao, S B Tree structures construction using key densities ACM Annual Conf, Minneapolis, Minn, 1975, pp 337–340.