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...
Guardado en:
Autores principales: | Kasián, Fernando, Ludueña, Verónica, Reyes, Nora Susana, Roggero, Patricia |
---|---|
Formato: | Objeto de conferencia |
Lenguaje: | Español |
Publicado: |
2013
|
Materias: | |
Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/31295 |
Aporte de: |
Ejemplares similares
-
An efficient alternative for deletions in dynamic spatial approximation trees
por: Kasián, Fernando, et al.
Publicado: (2014) -
An Efficient Dynamic Version of the Distal Spatial Approximation Trees
por: Chávez, Edgar, et al.
Publicado: (2022) -
Distal Dynamic Spatial Approximation Forest
por: Chávez, Edgar, et al.
Publicado: (2016) -
Approximate Nearest Neighbor Graph via Index Construction
por: Chávez, Edgar, et al.
Publicado: (2016) -
Decomposability of DiSAT for Index Dynamization
por: Chávez, Edgar, et al.
Publicado: (2017)