11072

Evaluating tradeoff between recall and performance of GPU permutation index

Mariela Lopresti, Natalia Miranda, Mercedes Barrionuevo, Fabiana Piccoli, Nora Reyes
LIDIC. Universidad Nacional de San Luis, Ejercito de los Andes 950 – 5700 – San Luis – Argentina
XIII Workshop procesamiento distribuido y paralelo (WPDP-13), 2013

@inproceedings{lopresti2013evaluating,

   title={Evaluating tradeoff between recall and perfomance of GPU permutation index},

   author={Lopresti, Mariela and Miranda, Natalia and Barrionuevo, Mercedes and Piccoli, Mar{‘i}a Fabiana and Reyes, Nora Susana},

   booktitle={XVIII Congreso Argentino de Ciencias de la Computaci{‘o}n},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

633

views

Query-by-content, by means of similarity search, is a fundamental operation for applications that deal with multimedia data. For this kind of query it is meaningless to look for elements exactly equal to a given one as query. Instead, we need to measure the dissimilarity between the query object and each database object. This search problem can be formalized with the concept of metric space. In this scenario, the search efficiency is understood as minimizing the number of distance calculations required to answer them. Building an index can be a solution, but with very large metric databases is not enough, it is also necessary to speed up the queries by using high performance computing, as GPU, and in some cases is reasonable to accept a fast answer although it was inexact. In this work we evaluate the tradeoff between the answer quality and time performance of our implementation of Permutation Index, on a pure GPU architecture, used to solve in parallel multiple approximate similarity searches on metric databases.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: