The Complexity of Trie Index Construction.

Douglas Comer, Ravi Sethi: The Complexity of Trie Index Construction. J. ACM 24(3): 428-440(1977)

@article{DBLP:journals/jacm/ComerS77,
  author    = {Douglas Comer and
               Ravi Sethi},
  title     = {The Complexity of Trie Index Construction},
  journal   = {J. ACM},
  volume    = {24},
  number    = {3},
  year      = {1977},
  pages     = {428-440},
  ee        = {db/journals/jacm/ComerS77.html, http://doi.acm.org/10.1145/322017.322023},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

BibTeX

Online Edition

Citation Page BibTeX

Referenced by

R. Ramesh, A. J. G. Babu, J. Peter Kincaid: Variable-Depth Trie Index Optimization: Theory and Experimental Results. ACM Trans. Database Syst. 14(1): 41-74(1989)
Richard J. Enbody, H. C. Du: Dynamic Hashing Schemes. ACM Comput. Surv. 20(2): 85-113(1988)
M. Al-Suwaiyel, Ellis Horowitz: Algorithms for Trie Compaction. ACM Trans. Database Syst. 9(2): 243-263(1984)
Douglas Comer: Analysis of a Heuristic for Trie Minimization. ACM Trans. Database Syst. 6(3): 513-537(1981)
Douglas Comer: Heuristics for Trie Index Minimization. ACM Trans. Database Syst. 4(3): 383-395(1979)

BibTeX