The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Communications of the ACM
An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
A compendium of key search references
ACM SIGIR Forum
Median split trees: a fast lookup technique for frequently occuring keys
Communications of the ACM
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
Time-Space Trade-Off Analysis of Morphic Trie Images
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
Use of a Morphosyntactic Lexicon as the Basis for the Implementation of the Greek Wordnet
NLP '00 Proceedings of the Second International Conference on Natural Language Processing
An improvement key deletion method for double-array structure using single-nodes
Information Processing and Management: an International Journal
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
A Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access
ICDAR '05 Proceedings of the Eighth International Conference on Document Analysis and Recognition
LZ trie and dictionary compression
Software—Practice & Experience
HAT-trie: a cache-conscious trie-based data structure for strings
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
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
A peer-to-peer approach to semantic web services discovery
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part IV
| Hi-index | 48.23 |
This paper presents a new data structure, called a compressed trie or C-trie, to be used in information retrieval systems. It has the same underlying m-ary tree structure as a trie, where m is a parameter of the trie, but whereas the fields of the nodes in a trie have to be large enough to hold a key or at least a pointer, the fields in a C-trie are only one bit long. In the analysis part of the paper it will be shown that for a collection of n keys the retrieval time, measured in terms of bit inspections of one key, is of the order logmn and the storage requirement of the order n·(m + log2n) bits. This improvement in storage requirements and retrieval time is achieved at the cost of decreasing the flexibility of the structure, and therefore updating costs are increased. First the C-trie is analyzed as a data structure, and then several methods of its use for relatively static databases are discussed.