Optimizing the spatial approximation tree from the root
Many computational applications need to look for information in a database. Nowadays, the predominance of nonconventional databases makes the similarity search (i.e., searching elements of the database that are "similar" to a given query) becomes a preponderant concept. The Spatial Approxi...
Guardado en:
| Autores principales: | Gómez, Alejandro J., Ludueña, Verónica, Reyes, Nora Susana |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2008
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/9632 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Jul08-9.pdf |
| Aporte de: |
Ejemplares similares
-
Fully dynamic and memory-adaptative spatial approximation trees
por: Arroyuelo, Diego, et al.
Publicado: (2003) -
Dynamic Spatial Approximation Trees with clusters for secondary memory
por: Britos, Luís, et al.
Publicado: (2010) -
An efficient alternative for deletions in dynamic spatial approximation trees
por: Kasián, Fernando, et al.
Publicado: (2014) -
New deletion method for dynamic spatial approximation trees
por: Kasián, Fernando, et al.
Publicado: (2013) -
An Efficient Dynamic Version of the Distal Spatial Approximation Trees
por: Chávez, Edgar, et al.
Publicado: (2022)