Evaluating tradeoff between recall and perfomance of GPU permutation index
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...
| Autores principales: | , , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2013
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/31737 |
| Aporte de: |
| id |
I19-R120-10915-31737 |
|---|---|
| record_format |
dspace |
| institution |
Universidad Nacional de La Plata |
| institution_str |
I-19 |
| repository_str |
R-120 |
| collection |
SEDICI (UNLP) |
| language |
Inglés |
| topic |
Ciencias Informáticas multimedia data database object query object performance computing PROCESSOR ARCHITECTURES Scientific databases |
| spellingShingle |
Ciencias Informáticas multimedia data database object query object performance computing PROCESSOR ARCHITECTURES Scientific databases Lopresti, Mariela Miranda, Natalia Carolina Barrionuevo, Mercedes Piccoli, María Fabiana Reyes, Nora Susana Evaluating tradeoff between recall and perfomance of GPU permutation index |
| topic_facet |
Ciencias Informáticas multimedia data database object query object performance computing PROCESSOR ARCHITECTURES Scientific databases |
| description |
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. |
| format |
Objeto de conferencia Objeto de conferencia |
| author |
Lopresti, Mariela Miranda, Natalia Carolina Barrionuevo, Mercedes Piccoli, María Fabiana Reyes, Nora Susana |
| author_facet |
Lopresti, Mariela Miranda, Natalia Carolina Barrionuevo, Mercedes Piccoli, María Fabiana Reyes, Nora Susana |
| author_sort |
Lopresti, Mariela |
| title |
Evaluating tradeoff between recall and perfomance of GPU permutation index |
| title_short |
Evaluating tradeoff between recall and perfomance of GPU permutation index |
| title_full |
Evaluating tradeoff between recall and perfomance of GPU permutation index |
| title_fullStr |
Evaluating tradeoff between recall and perfomance of GPU permutation index |
| title_full_unstemmed |
Evaluating tradeoff between recall and perfomance of GPU permutation index |
| title_sort |
evaluating tradeoff between recall and perfomance of gpu permutation index |
| publishDate |
2013 |
| url |
http://sedici.unlp.edu.ar/handle/10915/31737 |
| work_keys_str_mv |
AT loprestimariela evaluatingtradeoffbetweenrecallandperfomanceofgpupermutationindex AT mirandanataliacarolina evaluatingtradeoffbetweenrecallandperfomanceofgpupermutationindex AT barrionuevomercedes evaluatingtradeoffbetweenrecallandperfomanceofgpupermutationindex AT piccolimariafabiana evaluatingtradeoffbetweenrecallandperfomanceofgpupermutationindex AT reyesnorasusana evaluatingtradeoffbetweenrecallandperfomanceofgpupermutationindex |
| bdutipo_str |
Repositorios |
| _version_ |
1764820468739604481 |