Partial match queries in random quadtrees

Abstract : We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the data consist of independent and uniform points in the unit square. For this model, in a structure on $n$ points, it is known that the number of nodes $C_n(\xi)$ to visit in order to report the items matching an independent and uniformly on $[0,1]$ random query $\xi$ satisfies $\Ec{C_n(\xi)}\sim \kappa n^{\beta}$, where $\kappa$ and $\beta$ are explicit constants. We develop an approach based on the analysis of the cost $C_n(x)$ of any fixed query $x\in [0,1]$, and give precise estimates for the variance and limit distribution of the cost $C_n(x)$. Our results permit to describe a limit process for the costs $C_n(x)$ as $x$ varies in $[0,1]$; one of the consequences is that $E{\max_{x\in [0,1]} C_n(x)} \sim \gamma n^\beta$.
Type de document :
Communication dans un congrès
SoDA 2012 - Symposium on Discrete Algorithms, Jan 2012, Kyoto, Japan. pp.1056-1065, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. 〈10.1137/1.9781611973099.83〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00773365
Contributeur : Nicolas Broutin <>
Soumis le : dimanche 13 janvier 2013 - 16:05:32
Dernière modification le : vendredi 25 mai 2018 - 12:02:03

Lien texte intégral

Identifiants

Collections

Citation

Nicolas Broutin, Ralph Neininger, Henning Sulzbach. Partial match queries in random quadtrees. SoDA 2012 - Symposium on Discrete Algorithms, Jan 2012, Kyoto, Japan. pp.1056-1065, Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms. 〈10.1137/1.9781611973099.83〉. 〈hal-00773365〉

Partager

Métriques

Consultations de la notice

224