International Conference on Current Trends in Theory and Practice of Informatics

SOFSEM 2016: Theory and Practice of Computer Science pp 615-627

Evaluation of Static/Dynamic Cache for Similarity Search Engines

Conference paper

DOI: 10.1007/978-3-662-49192-8_50

Part of the Lecture Notes in Computer Science book series (LNCS, volume 9587)
Cite this paper as:
Solar R., Gil-Costa V., Marín M. (2016) Evaluation of Static/Dynamic Cache for Similarity Search Engines. In: Freivalds R., Engels G., Catania B. (eds) SOFSEM 2016: Theory and Practice of Computer Science. Lecture Notes in Computer Science, vol 9587. Springer, Berlin, Heidelberg

Abstract

In large scale search systems, where it is important to achieve a high query throughput, cache strategies are a feasible tool to achieve this goal. A number of efficient cache strategies devised for exact query search in different application domains have been proposed so far. In similarity query search on metric spaces it is necessary to consider additional design requirements devised to produce good quality approximate results from the cache content. In this paper, we propose a Static/Dynamic cache strategy for metric spaces which takes advantage of results of static cache miss operations and their associated distance evaluations for increasing the overall performance of the cache. We present an experimental evaluation of the performance obtained with our strategy for different query selection/replacement strategies.

Keywords

Approximate similarity search Metric cache 

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.CITIAPSUniversidad de Santiago de ChileSantiagoChile
  2. 2.Yahoo! Research Latin AmericaUNSL-CONICETSan LuisArgentina
  3. 3.DIINFUniversity of SantiagoSantiagoChile
  4. 4.Center for Biotechnology and BioengineeringUniversity of ChileSantiagoChile

Personalised recommendations