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...
Main Authors: | Alejandro J. Gómez, Verónica Ludueña, Nora Susana Reyes |
---|---|
Format: | Article |
Language: | English |
Published: |
Postgraduate Office, School of Computer Science, Universidad Nacional de La Plata
2008-07-01
|
Series: | Journal of Computer Science and Technology |
Subjects: | |
Online Access: | https://journal.info.unlp.edu.ar/JCST/article/view/750 |
Similar Items
-
An efficient alternative for deletions in dynamic spatial approximation trees
by: Fernando Kasián, et al.
Published: (2014-04-01) -
Spatial selection of sparse pivots for similarity search in metric spaces
by: Nieves Rodríguez Brisaboa, et al.
Published: (2007-03-01) -
Decomposability of DiSAT for Index Dynamization
by: Edgar Chávez, et al.
Published: (2017-10-01) -
XM-Tree, a new index for web information retrieval
by: Claudia Deco, et al.
Published: (2008-07-01) -
Center selection techniques for metric indexes
by: Cristian Mendoza Alric, et al.
Published: (2007-03-01)