Design, Analysis and Implementation of New Variants of Kd-trees

The representation of multidimensional data is a central issue in database design, as well as in many other elds, including computer graphics, com- putational geometry, pattern recognition, geographic information systems and others. Indeed, multidimensional points can represent locations, as well as...

Descripción completa

Detalles Bibliográficos
Autor: Pons Crespo, Maria Mercè
Tipo de recurso: tesis de maestría
Fecha de publicación:2010
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:2099.1/11309
Acceso en línea:https://hdl.handle.net/2099.1/11309
Access Level:acceso abierto
Palabra clave:Data structures (Computer science)
kd-trees
Representation of multidimensional data
Estructures de dades (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
id ES_4e7e188c635693036e63e802cdde247e
oai_identifier_str oai:upcommons.upc.edu:2099.1/11309
network_acronym_str ES
network_name_str España
repository_id_str
spelling Design, Analysis and Implementation of New Variants of Kd-treesPons Crespo, Maria MercèData structures (Computer science)kd-treesRepresentation of multidimensional dataEstructures de dades (Informàtica)Àrees temàtiques de la UPC::Informàtica::Informàtica teòricaThe representation of multidimensional data is a central issue in database design, as well as in many other elds, including computer graphics, com- putational geometry, pattern recognition, geographic information systems and others. Indeed, multidimensional points can represent locations, as well as more general records that arise in database management systems. For instance, consider an employee record that has attributes corresponding to the employee's name, address, sex, age, height and weight. Although the di erent dimensions have di erent data types (name and address are strings of characters; sex is a binary eld; and age, height and weight are numbers), these records can be treated as points in a six-dimensional space. We may see a database as a collection of records. Each record has several attributes, some of which are keys. The associative retrieval problem consists of answering queries with respect to a le of multidimensional records. Such an associative query requires the retrieval of those records in the le whose key attributes satisfy a certain condition. Examples of associative queries are intersection queries and nearest neighbor queries. In order to facilitate the retrieval of records based on some conditions on its key attributes, it is usually helpful to assumed the existence of an ordering for its values. In the case of numeric keys, such an ordering is quite obvious. In the case of alphanumeric keys, the ordering is usually based on the alphabetic sequence of the characters making up the attribute value. Furthermore, certain queries, like nearest neighbor searches, require the existence of a distance function.Universitat Politècnica de CatalunyaRoura Ferret, Salvador,20102010-09-0820112011-03-08master thesishttp://purl.org/coar/resource_type/c_bdccNAhttp://purl.org/coar/version/c_be7fb7dd8ff6fe43info:eu-repo/semantics/masterThesisapplication/pdfhttps://hdl.handle.net/2099.1/11309reponame:UPCommons. Portal del coneixement obert de la UPCinstname:Universitat Politècnica de Catalunya (UPC)Inglésengopen accesshttp://purl.org/coar/access_right/c_abf2Attribution-NonCommercial-NoDerivs 3.0 Spainhttp://creativecommons.org/licenses/by-nc-nd/3.0/es/info:eu-repo/semantics/openAccessoai:upcommons.upc.edu:2099.1/113092026-05-27T15:37:01Z
dc.title.none.fl_str_mv Design, Analysis and Implementation of New Variants of Kd-trees
title Design, Analysis and Implementation of New Variants of Kd-trees
spellingShingle Design, Analysis and Implementation of New Variants of Kd-trees
Pons Crespo, Maria Mercè
Data structures (Computer science)
kd-trees
Representation of multidimensional data
Estructures de dades (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
title_short Design, Analysis and Implementation of New Variants of Kd-trees
title_full Design, Analysis and Implementation of New Variants of Kd-trees
title_fullStr Design, Analysis and Implementation of New Variants of Kd-trees
title_full_unstemmed Design, Analysis and Implementation of New Variants of Kd-trees
title_sort Design, Analysis and Implementation of New Variants of Kd-trees
dc.creator.none.fl_str_mv Pons Crespo, Maria Mercè
author Pons Crespo, Maria Mercè
author_facet Pons Crespo, Maria Mercè
author_role author
dc.contributor.none.fl_str_mv Roura Ferret, Salvador,
dc.subject.none.fl_str_mv Data structures (Computer science)
kd-trees
Representation of multidimensional data
Estructures de dades (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
topic Data structures (Computer science)
kd-trees
Representation of multidimensional data
Estructures de dades (Informàtica)
Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
description The representation of multidimensional data is a central issue in database design, as well as in many other elds, including computer graphics, com- putational geometry, pattern recognition, geographic information systems and others. Indeed, multidimensional points can represent locations, as well as more general records that arise in database management systems. For instance, consider an employee record that has attributes corresponding to the employee's name, address, sex, age, height and weight. Although the di erent dimensions have di erent data types (name and address are strings of characters; sex is a binary eld; and age, height and weight are numbers), these records can be treated as points in a six-dimensional space. We may see a database as a collection of records. Each record has several attributes, some of which are keys. The associative retrieval problem consists of answering queries with respect to a le of multidimensional records. Such an associative query requires the retrieval of those records in the le whose key attributes satisfy a certain condition. Examples of associative queries are intersection queries and nearest neighbor queries. In order to facilitate the retrieval of records based on some conditions on its key attributes, it is usually helpful to assumed the existence of an ordering for its values. In the case of numeric keys, such an ordering is quite obvious. In the case of alphanumeric keys, the ordering is usually based on the alphabetic sequence of the characters making up the attribute value. Furthermore, certain queries, like nearest neighbor searches, require the existence of a distance function.
publishDate 2010
dc.date.none.fl_str_mv 2010
2010-09-08
2011
2011-03-08
dc.type.none.fl_str_mv master thesis
http://purl.org/coar/resource_type/c_bdcc
NA
http://purl.org/coar/version/c_be7fb7dd8ff6fe43
dc.type.openaire.fl_str_mv info:eu-repo/semantics/masterThesis
format masterThesis
dc.identifier.none.fl_str_mv https://hdl.handle.net/2099.1/11309
url https://hdl.handle.net/2099.1/11309
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
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
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
Attribution-NonCommercial-NoDerivs 3.0 Spain
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Universitat Politècnica de Catalunya
publisher.none.fl_str_mv Universitat Politècnica de Catalunya
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_ 1869407760098000896
score 15,300719

Similares en LA Referencia