Algorithms for trie compaction
ACM Transactions on Database Systems (TODS)
Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Complete inverted files for efficient text retrieval and analysis
Journal of the ACM (JACM)
Two Access Methods Using Compact Binary Trees
IEEE Transactions on Software Engineering
The world's fastest Scrabble program
Communications of the ACM
An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
Trie Hashing with Controlled Load
IEEE Transactions on Software Engineering
Implementing dynamic minimal-prefix tries
Software—Practice & Experience
An efficient implementation of trie structures
Software—Practice & Experience
Applications of finite automata representing large vocabularies
Software—Practice & Experience
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
ACM Computing Surveys (CSUR)
Communications of the ACM
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Communications of the ACM
Computer Programs for Spelling Correction
Computer Programs for Spelling Correction
Data Structure Techniques
Data Structures and Algorithms
Data Structures and Algorithms
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
A dynamic construction algorithm for the compact patricia trie using the hierarchical structure
Information Processing and Management: an International Journal
Adaptive Algorithms for Cache-Efficient Trie Search
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
A Method of Pre-computing Connectivity Relations for Japanese/Korean POS Tagging
CICLing '01 Proceedings of the Second International Conference on Computational Linguistics and Intelligent Text Processing
Optimal insertion in deterministic DAWGs
Theoretical Computer Science
Fast and compact updating algorithms of a double-array structure
Information Sciences—Informatics and Computer Science: 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
Partition search for non-binary constraint satisfaction
Information Sciences: an International Journal
A compact static double-array keeping character codes
Information Processing and Management: an International Journal
Estimation of FAQ knowledge bases by using semantic expressions for questions and answers
International Journal of Computer Applications in Technology
Implementation of dictionaries via automata and decision trees
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
Engineering scalable, cache and space efficient tries for strings
The VLDB Journal — The International Journal on Very Large Data Bases
A dictionary-based approach to fast and accurate name matching in large law enforcement databases
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Estimation of FAQ knowledge bases by introducing measurements
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Fast IP routing lookups for high performance routers
Computer Communications
| Hi-index | 0.01 |
A trie structure is frequently used for various applications, such as natural language dictionaries, database systems, and compilers. However, the total number of states (and transitions between them) of a trie becomes large so that space cost may not be acceptable for a huge key set. In order to resolve this disadvantage, this paper presents a new scheme, called "two-trie," that enables us to perform efficient retrievals, insertions, and deletions for the key sets. The essential idea is to construct two tries for both front and rear compressions of keys, which is similar to a DAWG (Directed Acyclic Word-Graph). The approach differs from a DAWG in that the two-trie approach presented can uniquely determine information corresponding to keys while a DAWG cannot. For an efficient implementation of the two-trie, two types of data structures are introduced. The theoretical and experimental observations show that the method presented is more practical than existing ones considering the use of dynamic key sets, storing information of keys, and compression of transitions.