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
Collections of functions for perfect hashing
SIAM Journal on Computing
Two Access Methods Using Compact Binary Trees
IEEE Transactions on Software Engineering
An Efficient Implementation of Static String Pattern Matching Machines
IEEE Transactions on Software Engineering
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
Reciprocal hashing: a method for generating minimal perfect hashing functions
Communications of the ACM
Minimal perfect hash functions made simple
Communications of the ACM
Communications of the ACM
Median split trees: a fast lookup technique for frequently occuring keys
Communications of the ACM
Perfect hashing functions: a single probe retrieving method for static sets
Communications of the ACM
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Communications of the ACM
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
Computer Programs for Spelling Correction
Computer Programs for Spelling Correction
Data Structure Techniques
Data Structures and Algorithms
Data Structures and Algorithms
A compendium of key search references
ACM SIGIR Forum
A Trie Compaction Algorithm for a Large Set of Keys
IEEE Transactions on Knowledge and Data Engineering
A dynamic construction algorithm for the compact patricia trie using the hierarchical structure
Information Processing and Management: an International Journal
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
An improvement key deletion method for double-array structure using single-nodes
Information Processing and Management: an International Journal
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
An efficient e-mail filtering using time priority measurement
Information Sciences—Informatics and Computer Science: An International Journal
Use of morphological analysis in protein name recognition
Journal of Biomedical Informatics - Special issue: Named entity recognition in biomedicine
Fast methods for kernel-based text analysis
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Learning sequence-to-sequence correspondences from parallel corpora via sequential pattern mining
HLT-NAACL-PARALLEL '03 Proceedings of the HLT-NAACL 2003 Workshop on Building and using parallel texts: data driven machine translation and beyond - Volume 3
An efficient deletion method for a minimal prefix double array: Research Articles
Software—Practice & Experience
A compact static double-array keeping character codes
Information Processing and Management: an International Journal
Text Entry Systems: Mobility, Accessibility, Universality
Text Entry Systems: Mobility, Accessibility, Universality
Estimation of FAQ knowledge bases by using semantic expressions for questions and answers
International Journal of Computer Applications in Technology
A method of reduction e-mails using replacement and repression
International Journal of Computer Applications in Technology
A compressed trie structure using divided keys
International Journal of Computer Applications in Technology
How to make the most of NE dictionaries in statistical NER
BioNLP '08 Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing
Intelligent QA Systems Using Semantic Expressions
KES '09 Proceedings of the 13th International Conference on Knowledge-Based and Intelligent Information and Engineering Systems: Part II
Polynomial to linear: efficient classification with conjunctive features
EMNLP '09 Proceedings of the 2009 Conference on Empirical Methods in Natural Language Processing: Volume 3 - Volume 3
A fast algorithm of retrieving common sentences
Information Sciences: an International Journal
An efficient dictionary mechanism based on double-byte
ICADL'07 Proceedings of the 10th international conference on Asian digital libraries: looking back 10 years and forging new frontiers
Compressed dynamic tries with applications to LZ-compression in sublinear time and space
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
New methods for compression of MP double array by compact management of suffixes
Information Processing and Management: an International Journal
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Kernel slicing: scalable online training with conjunctive features
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
A new technique of determining speaker's intention for sentences in conversation
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part IV
A GPU-Based accelerator for chinese word segmentation
APWeb'12 Proceedings of the 14th Asia-Pacific international conference on Web Technologies and Applications
Effectiveness of an implementation method for retrieving similar strings by trie structures
International Journal of Computer Applications in Technology
Efficient error-tolerant query autocompletion
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
An efficient digital search algorithm that is based on an internal array structure called a double array, which combines the fast access of a matrix form with the compactness of a list form, is presented. Each arc of a digital search tree, called a DS-tree, can be computed from the double array in 0(1) time; that is to say, the worst-case time complexity for retrieving a key becomes 0(k) for the length k of that key. The double array is modified to make the size compact while maintaining fast access, and algorithms for retrieval, insertion, and deletion are presented. If the size of the double array is n+cm, where n is the number of nodes of the DS-tree, m is the number of input symbols, and c is a constant particular to each double array, then it is theoretically proved that the worst-case times of deletion and insertion are proportional to cm and cm/sup 2/, respectively, and are independent of n. Experimental results of building the double array incrementally for various sets of keys show that c has an extremely small value, ranging from 0.17 to 1.13.