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

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 perform...

Descripción completa

Detalles Bibliográficos
Autores: Duch Brown, Amalia|||0000-0003-4371-1286, Martínez Parra, Conrado|||0000-0003-1302-9067
Tipo de recurso: informe técnico
Fecha de publicación:2001
País:España
Institución:Universitat Politècnica de Catalunya (UPC)
Repositorio:UPCommons. Portal del coneixement obert de la UPC
Idioma:inglés
OAI Identifier:oai:upcommons.upc.edu:2117/97828
Acceso en línea:https://hdl.handle.net/2117/97828
Access Level:acceso abierto
Palabra clave:Orthogonal range search
Multidimensional data structures
Random relaxed K-d trees
Àrees temàtiques de la UPC::Informàtica
id ES_a0ebac0dc85c401c05b2e896c8a035ff
oai_identifier_str oai:upcommons.upc.edu:2117/97828
network_acronym_str ES
network_name_str España
repository_id_str
spelling On the average performance of orthogonal range search in multidimensional data structuresDuch Brown, Amalia|||0000-0003-4371-1286Martínez Parra, Conrado|||0000-0003-1302-9067Orthogonal range searchMultidimensional data structuresRandom relaxed K-d treesÀrees temàtiques de la UPC::InformàticaIn 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.20012001-11-0120162016-12-07reporthttp://purl.org/coar/resource_type/c_93fcVoRhttp://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/reportapplication/postscripthttps://hdl.handle.net/2117/97828reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2117/978282026-05-27T15:37:01Z
dc.title.none.fl_str_mv On the average performance of orthogonal range search in multidimensional data structures
title On the average performance of orthogonal range search in multidimensional data structures
spellingShingle On the average performance of orthogonal range search in multidimensional data structures
Duch Brown, Amalia|||0000-0003-4371-1286
Orthogonal range search
Multidimensional data structures
Random relaxed K-d trees
Àrees temàtiques de la UPC::Informàtica
title_short On the average performance of orthogonal range search in multidimensional data structures
title_full On the average performance of orthogonal range search in multidimensional data structures
title_fullStr On the average performance of orthogonal range search in multidimensional data structures
title_full_unstemmed On the average performance of orthogonal range search in multidimensional data structures
title_sort On the average performance of orthogonal range search in multidimensional data structures
dc.creator.none.fl_str_mv Duch Brown, Amalia|||0000-0003-4371-1286
Martínez Parra, Conrado|||0000-0003-1302-9067
author Duch Brown, Amalia|||0000-0003-4371-1286
author_facet Duch Brown, Amalia|||0000-0003-4371-1286
Martínez Parra, Conrado|||0000-0003-1302-9067
author_role author
author2 Martínez Parra, Conrado|||0000-0003-1302-9067
author2_role author
dc.subject.none.fl_str_mv Orthogonal range search
Multidimensional data structures
Random relaxed K-d trees
Àrees temàtiques de la UPC::Informàtica
topic Orthogonal range search
Multidimensional data structures
Random relaxed K-d trees
Àrees temàtiques de la UPC::Informàtica
description 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.
publishDate 2001
dc.date.none.fl_str_mv 2001
2001-11-01
2016
2016-12-07
dc.type.none.fl_str_mv report
http://purl.org/coar/resource_type/c_93fc
VoR
http://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.openaire.fl_str_mv info:eu-repo/semantics/report
format report
dc.identifier.none.fl_str_mv https://hdl.handle.net/2117/97828
url https://hdl.handle.net/2117/97828
dc.language.none.fl_str_mv Inglés
eng
language_invalid_str_mv Inglés
language eng
dc.rights.none.fl_str_mv open access
http://purl.org/coar/access_right/c_abf2
dc.rights.openaire.fl_str_mv info:eu-repo/semantics/openAccess
rights_invalid_str_mv open access
http://purl.org/coar/access_right/c_abf2
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/postscript
dc.source.none.fl_str_mv reponame:UPCommons. Portal del coneixement obert de la UPC
instname:Universitat Politècnica de Catalunya (UPC)
instname_str Universitat Politècnica de Catalunya (UPC)
reponame_str UPCommons. Portal del coneixement obert de la UPC
collection UPCommons. Portal del coneixement obert de la UPC
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869415085151092736
score 15.300724

Similares en LA Referencia