Expected worst-case partial match in random quadtries

Authors:
Luc Devroye;Carlos Zamora-Cura
Affiliations:
School of Computer Science, McGill University, Montreal, Canada H3A 2K6;Instituto de Matemticas, Universidad Nacional Autnoma de Mexico, D.F., Mexico
Venue:
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Year:
2004

Citing 11
Cited 0

Partial match retrieval of multidimensional data

Journal of the ACM (JACM)
Trie partitioning process: limiting distributions

CAAP '86 Proceedings of the 11th colloquium on trees in algebra and programming
Some results on V-ary asymmetric tries

Journal of Algorithms
The variance of a partial match retrieval in a multidimensional symmetric trie

Random Structures & Algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching

The art of computer programming, volume 3: (2nd ed.) sorting and searching
Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing

SCG '85 Proceedings of the first annual symposium on Computational geometry
A sharp concentration inequality with application

Random Structures & Algorithms
Limiting distributions for the costs of partial match retrievals in multidimensional tries

Proceedings of the ninth international conference on on Random structures and algorithms
Trie memory

Communications of the ACM
Digital Data Structures and Order Statistics

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
A Branching Process Arising in Dynamic Hashing, Trie Searching and Polynomial Factorization

Proceedings of the 9th Colloquium on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider random multivariate quadtries obtained from n points independently and uniformly distributed on the unit cube of Rd Let Nn(y) be the complexity of the standard partial match algorithm for fixed vector y, where y is a vector in Rs O s d. We study Nn=supy Nn(y), the worst-case time for partial match. Among other things, we show that partial match is very stable, in the sense that supy Nn(y)/infy Nn(y) → 1 in probability.