On the average performance of fixed partial match queries in random relaxed K-d trees

All of RECERCAT

To access the full text documents, please follow this link: http://hdl.handle.net/2117/24268

Title:	On the average performance of fixed partial match queries in random relaxed K-d trees
Author:	Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació; Universitat Politècnica de Catalunya. ALBCOM - Algorismia, Bioinformàtica, Complexitat i Mètodes Formals
Abstract:	We obtain an explicit formula for the expected cost of a fixed partial match query in a random relaxed K-d tree, that is, the expected cost for a query of the form q = (q0 , q1 , . . . , qK-1 ) with 0 < s < K specified coordinates with values z0 , . . . , zs-1 ¿ (0, 1). This is a generalization of previous results in the literature for s = 1. Qualitatively similar results hold for standard K-d trees and we conjecture that this also holds for other multidimensional tree structures such as quadtrees and K-d tries.
Abstract:	Peer Reviewed
Subject(s):	-Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica -Computer algorithms -Partial match -K-d trees -Multidimensional data structures -Associative queries -Algorismes computacionals
Rights:
Document type:	Article - Published version Conference Object
Share: