Complexity of trie index construction

@article{Comer1976ComplexityOT,
  title={Complexity of trie index construction},
  author={Douglas Comer and Ravi Sethi},
  journal={17th Annual Symposium on Foundations of Computer Science (sfcs 1976)},
  year={1976},
  pages={197-207}
}
Trie structures are a convenient way of indexing files in which keys are specified by values of attributes. Records correspond to leaves in the trie. Retrieval proceeds by following a path from the root to a leaf, the choice of edges being determined by attribute values. The size of a trie for a file depends on the order in which attributes are tested. We show that determining minimal size tries is an NP-complete problem for several variants of tries. For tries in which leaf chains are deleted… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.
10 Citations
4 References
Similar Papers

Similar Papers

Loading similar papers…