Digital search trees revisited
SIAM Journal on Computing
Trie partitioning process: limiting distributions
CAAP '86 Proceedings of the 11th colloquium on trees in algebra and programming
Data compression: methods and theory
Data compression: methods and theory
Some results on V-ary asymmetric tries
Journal of Algorithms
Elements of information theory
Elements of information theory
Improved behaviour of tries by adaptive branching
Information Processing Letters
Autocorrelation on words and its applications: analysis of suffix trees by string-ruler approach
Journal of Combinatorial Theory Series A
Patricia tries again revisited
Journal of the ACM (JACM)
Extendible hashing—a fast access method for dynamic files
ACM Transactions on Database Systems (TODS)
PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
Analytic variations on bucket selection and sorting
Acta Informatica
File structures using hashing functions
Communications of the ACM
Use of tree structures for processing files
Communications of the ACM
Communications of the ACM
Universal Compression and Retrieval
Universal Compression and Retrieval
Random Structures & Algorithms - Special issue on analysis of algorithms dedicated to Don Knuth on the occasion of his (100)8th birthday
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Some Results on Tries with Adaptive Branching
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
On the average depth of asymmetric LC-tries
Information Processing Letters
On the average depth of asymmetric LC-tries
Information Processing Letters
| Hi-index | 0.01 |
We propose a pre-processing technique for improving performance of digital tree (trie)-based search algorithms under asymmetric memoryless sources. This technique (which we call a symmetrization of the source) bijectively maps the sequences of symbols from the original (asymmetric) source into symbols of an output alphabet with a more uniform distribution. We introduce a criterion of efficiency for such a mapping, and demonstrate that a problem of finding an optimal for a given source (or universal) symmetrization transform is equivalent to a problem of constructing a minimum redundancy variable-length-to-block code for this source (or class of sources). Based on this result, we propose search algorithms that incorporate known (optimal for a given source and universal) variable-length-to-block codes and study their asymptotic behaviour. We complement our analysis with a description of an efficient algorithm for universal symmetrization of binary memoryless sources, and compare the performance of the resulting search structure with the standard tries.