Adaptive and Dynamic Pivot Selection for Similarity Search

Authors

  • Mariano Salvetti Universidad Nacional de Rosario
  • Claudia Deco Universidad Nacional de Rosario
  • Nora Reyes Universidad Nacional de San Luis
  • Cristina Bender Universidad Nacional de Rosario

DOI:

https://doi.org/10.5753/jidm.2011.1382

Keywords:

Metric databases, Dynamic index, Sparse Spatial Selection

Abstract

In this paper, a new indexing and similarity search method based on dynamic selection of pivots is presented. It uses Sparse Spatial Selection (SSS) for the initial selection of pivots. Two new selection policies of pivots are added, in order to the index suits itself to searches when it adapts to the metric space. The proposed structure automatically adjusts to the region where most of searches are made. In this way, the amount of distance computations during searches is reduced. The adjustment is done using the policy of 'the most candidate' for the incoming pivot selection, and the policy of 'the least discriminating' for the outgoing pivot selection.

Downloads

Download data is not yet available.

Downloads

Published

2011-08-12

How to Cite

Salvetti, M., Deco, C., Reyes, N., & Bender, C. (2011). Adaptive and Dynamic Pivot Selection for Similarity Search. Journal of Information and Data Management, 2(1), 27. https://doi.org/10.5753/jidm.2011.1382

Issue

Section

SBBD 2010 Short Papers