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

Consultar RECERCAT

Para acceder a los documentos con el texto completo, por favor, siga el siguiente enlace: http://hdl.handle.net/2117/97828

Título:	On the average performance of orthogonal range search in multidimensional data structures
Autor/a:	Duch Brown, Amalia; Martínez Parra, Conrado
Otros autores:	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.
Materia(s):	-Àrees temàtiques de la UPC::Informàtica -Orthogonal range search -Multidimensional data structures -Random relaxed K-d trees
Derechos:
Tipo de documento:	Artículo - Versión publicada Informe
Compartir:

Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado

Duch Brown, Amalia; Jiménez Gómez, Rosa María; Martínez Parra, Conrado

Martínez Parra, Conrado; Estivill-Castro, V.; Duch Brown, Amalia

Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado

Duch Brown, Amalia; Lau Laynes-Lozada, Gustavo Salvador; Martínez Parra, Conrado

Coordinación

Patrocinio