New deletion method for dynamic spatial approximation trees

The Dynamic Spatial Approximation Tree (DSAT) is a data structure specially designed for searching in metric spaces. It has been shown that it compares favorably against alternative data structures in spaces of high dimension or queries with low selectivity. The DSAT supports insertion and deletions...

Descripción completa

Detalles Bibliográficos
Autores principales: Kasián, Fernando, Ludueña, Verónica, Reyes, Nora Susana, Roggero, Patricia
Formato: Objeto de conferencia
Lenguaje:Español
Publicado: 2013
Materias:
Ciencias Informáticas
multimedia databases
metric spaces
similarity search
DATABASE MANAGEMENT
Data mining
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/31295
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-31295
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Español
topic Ciencias Informáticas
multimedia databases
metric spaces
similarity search
DATABASE MANAGEMENT
Data mining
spellingShingle Ciencias Informáticas
multimedia databases
metric spaces
similarity search
DATABASE MANAGEMENT
Data mining
Kasián, Fernando
Ludueña, Verónica
Reyes, Nora Susana
Roggero, Patricia
New deletion method for dynamic spatial approximation trees
topic_facet Ciencias Informáticas
multimedia databases
metric spaces
similarity search
DATABASE MANAGEMENT
Data mining
description The Dynamic Spatial Approximation Tree (DSAT) is a data structure specially designed for searching in metric spaces. It has been shown that it compares favorably against alternative data structures in spaces of high dimension or queries with low selectivity. The DSAT supports insertion and deletions of elements. However, it has been noted that eliminations degrade the structure over time. In [8] is proposed a method to handle deletions over the DSAT, which shown to be superior to the former in the sense that it permits controlling the expected deletion cost as a proportion of the insertion cost. In this paper we propose and study a new deletion method, based on the deletions strategies presented in [8], which has demonstrated to be better. The outcome is a fully dynamic data structure that can be managed through insertions and deletions over arbitrarily long periods of time without any reorganization.
format Objeto de conferencia
Objeto de conferencia
author Kasián, Fernando
Ludueña, Verónica
Reyes, Nora Susana
Roggero, Patricia
author_facet Kasián, Fernando
Ludueña, Verónica
Reyes, Nora Susana
Roggero, Patricia
author_sort Kasián, Fernando
title New deletion method for dynamic spatial approximation trees
title_short New deletion method for dynamic spatial approximation trees
title_full New deletion method for dynamic spatial approximation trees
title_fullStr New deletion method for dynamic spatial approximation trees
title_full_unstemmed New deletion method for dynamic spatial approximation trees
title_sort new deletion method for dynamic spatial approximation trees
publishDate 2013
url http://sedici.unlp.edu.ar/handle/10915/31295
work_keys_str_mv AT kasianfernando newdeletionmethodfordynamicspatialapproximationtrees
AT luduenaveronica newdeletionmethodfordynamicspatialapproximationtrees
AT reyesnorasusana newdeletionmethodfordynamicspatialapproximationtrees
AT roggeropatricia newdeletionmethodfordynamicspatialapproximationtrees
bdutipo_str Repositorios
_version_ 1764820470951051265

Ejemplares similares