Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Partial match queries in relaxed K-dt trees

Autor
Duch, A.; Lau, G.
Tipus d'activitat
Presentació treball a congrés
Nom de l'edició
Fourteenth Workshop on Analytic Algorithmics and Combinatorics
Any de l'edició
2017
Data de presentació
2017-01-16
Llibre d'actes
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017
Pàgina inicial
131
Pàgina final
138
Editor
Society for Industrial and Applied Mathematics (SIAM)
DOI
https://doi.org/10.1137/1.9781611974775.13 Obrir en finestra nova
Projecte finançador
SGR 2014:1034
TIN2013-46181-C2-1-R Modelos y Métodos Computacionales para Datos Masivos Estructurados
Repositori
http://hdl.handle.net/2117/101520 Obrir en finestra nova
URL
http://dx.doi.org/10.1137/1.9781611974775.13 Obrir en finestra nova
Resum
The study of partial match queries on random hierarchical multidimensional data structures dates back to Ph. Flajolet and C. Puech’s 1986 seminal paper on partial match retrieval. It was not until recently that fixed (as opposed to random) partial match queries were studied for random relaxed K-d trees, random standard K-d trees, and random 2-dimensional quad trees. Based on those results it seemed natural to classify the general form of the cost of fixed partial match queries into two familie...
Citació
Duch, A., Lau, G. Partial match queries in relaxed K-dt trees. A: Workshop on Analytic Algorithmics and Combinatorics. "Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2017, Barcelona, Spain, Hotel Porta Fira, January 16-17, 2017". Barcelona: Society for Industrial and Applied Mathematics (SIAM), 2017, p. 131-138.
Grup de recerca
ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals

Participants

  • Duch Brown, Amalia  (autor ponent)
  • Lau Laynes-Lozada, Gustavo Salvador  (autor ponent)

Arxius