Partial match retrieval of multidimensional data
Journal of the ACM (JACM)
An Efficient Digital Search Algorithm by Using a Double-Array Structure
IEEE Transactions on Software Engineering
An efficient implementation of trie structures
Software—Practice & Experience
Efficient implementation of suffix trees
Software—Practice & Experience
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
The analysis of hybrid trie structures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Randomized binary searching with tree structures
Communications of the ACM
Communications of the ACM
Fast insertion methods of a double-array structure
Software—Practice & Experience
Burst tries: a fast, efficient data structure for string keys
ACM Transactions on Information Systems (TOIS)
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
CPM '99 Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching
Indexing text using the Ziv-Lempel trie
Journal of Discrete Algorithms - SPIRE 2002
Compilers: Principles, Techniques, and Tools (2nd Edition)
Compilers: Principles, Techniques, and Tools (2nd Edition)
An efficient deletion method for a minimal prefix double array: Research Articles
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
A compact static double-array keeping character codes
Information Processing and Management: an International Journal
Searching large indexes on tiny devices: optimizing binary search with character pinning
Proceedings of the 14th international conference on Intelligent user interfaces
Engineering the LOUDS succinct tree representation
WEA'06 Proceedings of the 5th international conference on Experimental Algorithms
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
IP-address lookup using LC-tries
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
Minimal Prefix (MP) double array is an efficient data structure for a trie. However, its space efficiency is degraded by the non-compact management of suffixes. This paper presents three methods to compress the MP double array. The first two methods compress the MP double array by accommodating short suffixes inside the leaf nodes, and pruning leaf nodes corresponding to the end marker symbol. These methods achieve size reduction of up to 20%, making insertion and deletion faster at the same time while maintaining the retrieval time of O(1). The third method eliminates empty spaces in the array that holds suffixes, and improves the maximum size reduction further by about 5% at the cost of increased insertion time. Compared to a Ternary Search Tree, the key retrieval of the compressed MP double array is 50% faster and its size is 3-5 times smaller.