Dynamic selection of suitable pivots for similarity search in metric spaces

This paper presents a data structure based on Sparse Spatial Selection (SSS) for similarity searching. An algorithm that tries periodically to adjust pivots to the use of database index is presented. This index is dynamic. In this way, it is possible to improve the amount of discriminations done by...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Deco, Claudia, Salvetti, Mariano, Reyes, Nora Susana, Bender, Cristina
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2009
Materias:
Ciencias Informáticas
Índices
Base de Datos
metric databases
dynamic index
Sparse Spatial Selection
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/21147
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
Descripción
Sumario:This paper presents a data structure based on Sparse Spatial Selection (SSS) for similarity searching. An algorithm that tries periodically to adjust pivots to the use of database index is presented. This index is dynamic. In this way, it is possible to improve the amount of discriminations done by the pivots. So, the primary objective of indexes is achieved: to reduce the number of distance function evaluations, as it is showed in the experimentation

Ejemplares similares