On the average performance of orthogonal range search in multidimensional data structures

All of RECERCAT

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

Title:	On the average performance of orthogonal range search in multidimensional data structures
Author:	Duch Brown, Amalia; Martínez Parra, Conrado
Other authors:	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
Abstract:	In this work we present the average-case analysis of orthogonal range search for several multidimensional data structures. We first consider random relaxed K-d trees as a prototypical example and later extend our results to several different multidimensional data structures. We show that the performance of range searches is related to the performance of a variant of partial matches which simplifies the analysis and provides a tight asymptotic estimate for the expected cost of range searches.
Subject(s):	-Àrees temàtiques de la UPC::Informàtica -Orthogonal range search -Multidimensional data structures -Random relaxed K-d trees
Rights:
Document type:	Article - Published version Report
Share: