New deletion method for dynamic spatial approximation trees
- Autores
- Kasián, Fernando; Ludueña, Verónica; Reyes, Nora Susana; Roggero, Patricia
- Año de publicación
- 2013
- Idioma
- español castellano
- Tipo de recurso
- documento de conferencia
- Estado
- versión publicada
- Descripción
- 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.
X Workshop bases de datos y minería de datos
Red de Universidades con Carreras en Informática (RedUNCI) - Materia
-
Ciencias Informáticas
multimedia databases
metric spaces
similarity search
DATABASE MANAGEMENT
Data mining - Nivel de accesibilidad
- acceso abierto
- Condiciones de uso
- http://creativecommons.org/licenses/by-nc-sa/2.5/ar/
- Repositorio
- Institución
- Universidad Nacional de La Plata
- OAI Identificador
- oai:sedici.unlp.edu.ar:10915/31295
Ver los metadatos del registro completo
id |
SEDICI_e4242cca45e93632c4ab371a02d4c51c |
---|---|
oai_identifier_str |
oai:sedici.unlp.edu.ar:10915/31295 |
network_acronym_str |
SEDICI |
repository_id_str |
1329 |
network_name_str |
SEDICI (UNLP) |
spelling |
New deletion method for dynamic spatial approximation treesKasián, FernandoLudueña, VerónicaReyes, Nora SusanaRoggero, PatriciaCiencias Informáticasmultimedia databasesmetric spacessimilarity searchDATABASE MANAGEMENTData miningThe 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.X Workshop bases de datos y minería de datosRed de Universidades con Carreras en Informática (RedUNCI)2013-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfhttp://sedici.unlp.edu.ar/handle/10915/31295spainfo:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/2.5/ar/Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:30:38Zoai:sedici.unlp.edu.ar:10915/31295Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:30:39.142SEDICI (UNLP) - Universidad Nacional de La Platafalse |
dc.title.none.fl_str_mv |
New deletion method for dynamic spatial approximation trees |
title |
New deletion method for dynamic spatial approximation trees |
spellingShingle |
New deletion method for dynamic spatial approximation trees Kasián, Fernando Ciencias Informáticas multimedia databases metric spaces similarity search DATABASE MANAGEMENT Data mining |
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 |
dc.creator.none.fl_str_mv |
Kasián, Fernando Ludueña, Verónica Reyes, Nora Susana Roggero, Patricia |
author |
Kasián, Fernando |
author_facet |
Kasián, Fernando Ludueña, Verónica Reyes, Nora Susana Roggero, Patricia |
author_role |
author |
author2 |
Ludueña, Verónica Reyes, Nora Susana Roggero, Patricia |
author2_role |
author author author |
dc.subject.none.fl_str_mv |
Ciencias Informáticas multimedia databases metric spaces similarity search DATABASE MANAGEMENT Data mining |
topic |
Ciencias Informáticas multimedia databases metric spaces similarity search DATABASE MANAGEMENT Data mining |
dc.description.none.fl_txt_mv |
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. X Workshop bases de datos y minería de datos Red de Universidades con Carreras en Informática (RedUNCI) |
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. |
publishDate |
2013 |
dc.date.none.fl_str_mv |
2013-10 |
dc.type.none.fl_str_mv |
info:eu-repo/semantics/conferenceObject info:eu-repo/semantics/publishedVersion Objeto de conferencia http://purl.org/coar/resource_type/c_5794 info:ar-repo/semantics/documentoDeConferencia |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.none.fl_str_mv |
http://sedici.unlp.edu.ar/handle/10915/31295 |
url |
http://sedici.unlp.edu.ar/handle/10915/31295 |
dc.language.none.fl_str_mv |
spa |
language |
spa |
dc.rights.none.fl_str_mv |
info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
eu_rights_str_mv |
openAccess |
rights_invalid_str_mv |
http://creativecommons.org/licenses/by-nc-sa/2.5/ar/ Creative Commons Attribution-NonCommercial-ShareAlike 2.5 Argentina (CC BY-NC-SA 2.5) |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:SEDICI (UNLP) instname:Universidad Nacional de La Plata instacron:UNLP |
reponame_str |
SEDICI (UNLP) |
collection |
SEDICI (UNLP) |
instname_str |
Universidad Nacional de La Plata |
instacron_str |
UNLP |
institution |
UNLP |
repository.name.fl_str_mv |
SEDICI (UNLP) - Universidad Nacional de La Plata |
repository.mail.fl_str_mv |
alira@sedici.unlp.edu.ar |
_version_ |
1842260149985607680 |
score |
13.13397 |