Fully dynamic and memory-adaptative spatial approximation trees

Hybrid dynamic spatial approximation trees are recently proposed data structures for searching in metric spaces, based on combining the concepts of spatial approximation and pivot based algorithms. These data structures are hybrid schemes, with the full features of dynamic spatial approximation tree...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Arroyuelo, Diego, Navarro, Gonzalo, Reyes, Nora Susana
Formato:	Objeto de conferencia
Lenguaje:	Inglés
Publicado:	2003
Materias:	Ciencias Informáticas databases data structures metric spaces Algorithms base de datos Metrics
Acceso en línea:	http://sedici.unlp.edu.ar/handle/10915/22852
Aporte de:	SEDICI (UNLP) de Universidad Nacional de La Plata

id	I19-R120-10915-22852
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 databases data structures metric spaces Algorithms base de datos Metrics
spellingShingle	Ciencias Informáticas databases data structures metric spaces Algorithms base de datos Metrics Arroyuelo, Diego Navarro, Gonzalo Reyes, Nora Susana Fully dynamic and memory-adaptative spatial approximation trees
topic_facet	Ciencias Informáticas databases data structures metric spaces Algorithms base de datos Metrics
description	Hybrid dynamic spatial approximation trees are recently proposed data structures for searching in metric spaces, based on combining the concepts of spatial approximation and pivot based algorithms. These data structures are hybrid schemes, with the full features of dynamic spatial approximation trees and able of using the available memory to improve the query time. It has been shown that they compare favorably against alternative data structures in spaces of medium difficulty. In this paper we complete and improve hybrid dynamic spatial approximation trees, by presenting a new search alternative, an algorithm to remove objects from the tree, and an improved way of managing the available memory. The result is a fully dynamic and optimized data structure for similarity searching in metric spaces.
format	Objeto de conferencia Objeto de conferencia
author	Arroyuelo, Diego Navarro, Gonzalo Reyes, Nora Susana
author_facet	Arroyuelo, Diego Navarro, Gonzalo Reyes, Nora Susana
author_sort	Arroyuelo, Diego
title	Fully dynamic and memory-adaptative spatial approximation trees
title_short	Fully dynamic and memory-adaptative spatial approximation trees
title_full	Fully dynamic and memory-adaptative spatial approximation trees
title_fullStr	Fully dynamic and memory-adaptative spatial approximation trees
title_full_unstemmed	Fully dynamic and memory-adaptative spatial approximation trees
title_sort	fully dynamic and memory-adaptative spatial approximation trees
publishDate	2003
url	http://sedici.unlp.edu.ar/handle/10915/22852
work_keys_str_mv	AT arroyuelodiego fullydynamicandmemoryadaptativespatialapproximationtrees AT navarrogonzalo fullydynamicandmemoryadaptativespatialapproximationtrees AT reyesnorasusana fullydynamicandmemoryadaptativespatialapproximationtrees
bdutipo_str	Repositorios
_version_	1764820467848314882

Fully dynamic and memory-adaptative spatial approximation trees

Ejemplares similares