Decomposability of DiSAT for Index Dynamization

The Distal Spatial Approximation Tree (DiSAT) is one of the most competitive indexes for exact proximity searching. The absence of parameters, the most salient feature, makes the index a suitable choice for a practitioner. The most serious drawback is the static nature of the index, not allowing fur...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Chávez, Edgar, Di Genaro, María E., Reyes, Nora Susana, Roggero, Patricia
Formato: Articulo
Lenguaje:Inglés
Publicado: 2017
Materias:
Ciencias Informáticas
similarity search
dynamism
metric spaces
non-conventional databases
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/62937
http://journal.info.unlp.edu.ar/wp-content/uploads/2017/10/JCST-45-Paper-3.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-62937
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
similarity search
dynamism
metric spaces
non-conventional databases
spellingShingle Ciencias Informáticas
similarity search
dynamism
metric spaces
non-conventional databases
Chávez, Edgar
Di Genaro, María E.
Reyes, Nora Susana
Roggero, Patricia
Decomposability of DiSAT for Index Dynamization
topic_facet Ciencias Informáticas
similarity search
dynamism
metric spaces
non-conventional databases
description The Distal Spatial Approximation Tree (DiSAT) is one of the most competitive indexes for exact proximity searching. The absence of parameters, the most salient feature, makes the index a suitable choice for a practitioner. The most serious drawback is the static nature of the index, not allowing further insertions once it is built. On the other hand, there is an old approach from Bentley and Saxe (BS) allowing the dynamization of decomposable data structures. The only requirement is to provide a decomposition operation. This is precisely our contribution, we define a decomposition operation allowing the application of the BS technique. The resulting data structure is competitive against the static counterparts.
format Articulo
Articulo
author Chávez, Edgar
Di Genaro, María E.
Reyes, Nora Susana
Roggero, Patricia
author_facet Chávez, Edgar
Di Genaro, María E.
Reyes, Nora Susana
Roggero, Patricia
author_sort Chávez, Edgar
title Decomposability of DiSAT for Index Dynamization
title_short Decomposability of DiSAT for Index Dynamization
title_full Decomposability of DiSAT for Index Dynamization
title_fullStr Decomposability of DiSAT for Index Dynamization
title_full_unstemmed Decomposability of DiSAT for Index Dynamization
title_sort decomposability of disat for index dynamization
publishDate 2017
url http://sedici.unlp.edu.ar/handle/10915/62937
http://journal.info.unlp.edu.ar/wp-content/uploads/2017/10/JCST-45-Paper-3.pdf
work_keys_str_mv AT chavezedgar decomposabilityofdisatforindexdynamization
AT digenaromariae decomposabilityofdisatforindexdynamization
AT reyesnorasusana decomposabilityofdisatforindexdynamization
AT roggeropatricia decomposabilityofdisatforindexdynamization
bdutipo_str Repositorios
_version_ 1764820480169082883

Ejemplares similares