Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Trie structured index minimization.
Trie structured index minimization.
Storage optimization of tree structured files representing descriptor sets
SIGFIDET '71 Proceedings of the 1971 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control
A compendium of key search references
ACM SIGIR Forum
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Current practice in the evaluation of multikey search algorithms
SIGIR '83 Proceedings of the 6th annual international ACM SIGIR conference on Research and development in information retrieval
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Information filtering and query indexing for an information retrieval model
ACM Transactions on Information Systems (TOIS)
| Hi-index | 0.00 |
A trie is a distributed-key search tree in which records from a file correspond to leaves in the tree. Retrieval consists of following a path from one root to a leaf, where the choice of edge at each node is determined by attribute values of the key. For full tries, those in which all leaves lie at the same depth, the problem of finding an ordering of attributes which yields a minimum size trie is NP-complete.This paper considers a “greedy” heuristic for constructing low-cost tries. It presents simulation experiments which show that the greedy method tends to produce tries with small size, and analysis leading to a worst case bound on approximations produced by the heuristic. It also shows a class of files for which the greedy method may perform badly, producing tries of high cost.