Partial match queries in relaxed K-dt trees
Tipus de documentText en actes de congrés
EditorSociety for Industrial and Applied Mathematics (SIAM)
Condicions d'accésAccés obert
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 families: that of either random hierarchical structures or perfectly balanced structures, as conjectured by Duch, Lau and Martínez (On the Cost of Fixed Partial Queries in K-d trees Algorithmica, 75(4):684–723, 2016). Here we show that the conjecture just mentioned does not hold by introducing relaxed K-dt trees and providing the average-case analysis for random partial match queries as well as some advances on the average-case analysis for fixed partial match queries on them. In fact this cost –for fixed partial match queries– does not follow the conjectured forms.
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.
Versió de l'editorhttp://dx.doi.org/10.1137/1.9781611974775.13