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

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.author	Duch Brown, Amalia
dc.contributor.author	Martínez Parra, Conrado
dc.date	2001-11
dc.identifier.citation	Duch, A., Martinez, C. "On the average performance of orthogonal range search in multidimensional data structures". 2001.
dc.identifier.uri	http://hdl.handle.net/2117/97828
dc.language.iso	eng
dc.relation	LSI-01-54-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica
dc.subject	Orthogonal range search
dc.subject	Multidimensional data structures
dc.subject	Random relaxed K-d trees
dc.title	On the average performance of orthogonal range search in multidimensional data structures
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
dc.description.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.

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