The analysis of partial match queries in random multidimensional trees: A selected survey
We analyze the probabilistic performance of partial match queries in random multidimensional search trees, using k-d trees (and their variants) and quadtrees, as primary examples. A partial match query aims to retrieve all points from a tree that match a given query point on a predetermined subset o...
| Autores: | , , , |
|---|---|
| Formato: | artículo |
| Fecha de publicación: | 2026 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/456252 |
| Acesso em linha: | https://hdl.handle.net/2117/456252 https://dx.doi.org/10.1016/j.cosrev.2026.100904 |
| Access Level: | acceso abierto |
| Palavra-chave: | Multidimensional data structures k-dimensional trees Quadtrees Partial match queries Associative queries Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
| Resumo: | We analyze the probabilistic performance of partial match queries in random multidimensional search trees, using k-d trees (and their variants) and quadtrees, as primary examples. A partial match query aims to retrieve all points from a tree that match a given query point on a predetermined subset of coordinates. As one of the most basic associative searches, its analysis is foundational for evaluating more complex queries. This selection of data structures allows us to demonstrate common analytical techniques and offer a historical perspective on the field. |
|---|