Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Heuristics for trie index minimization
ACM Transactions on Database Systems (TODS)
The difficulty of optimum index selection
ACM Transactions on Database Systems (TODS)
The Complexity of Trie Index Construction
Journal of the ACM (JACM)
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Algorithms for trie compaction.
Algorithms for trie compaction.
A compendium of key search references
ACM SIGIR Forum
Table compression for tree automata
ACM Transactions on Programming Languages and Systems (TOPLAS)
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
A compression algorithm using integrated record information for translation dictionaries
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Compression techniques for fast external sorting
The VLDB Journal — The International Journal on Very Large Data Bases
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
Scalable parallel word search in multicore/multiprocessor systems
The Journal of Supercomputing
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
Wire speed name lookup: a GPU-based approach
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
The trie data structure has many properties which make it especially attractive for representing large files of data. These properties include fast retrieval time, quick unsuccessful search determination, and finding the longest match to a given identifier. The main drawback is the space requirement. In this paper the concept of trie compaction is formalized. An exact algorithm for optimal trie compaction and three algorithms for approximate trie compaction are given, and an analysis of the three algorithms is done. The analysis indicate that for actual tries, reductions of around 70 percent in the space required by the uncompacted trie can be expected. The quality of the compaction is shown to be insensitive to the number of nodes, while a more relevant parameter is the alphabet size of the key.