Optimizing Sorting and Top-k Selection Steps in Permutation Based Indexing on GPUs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F15%3A10294744" target="_blank" >RIV/00216208:11320/15:10294744 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1007/978-3-319-23201-0_33" target="_blank" >http://dx.doi.org/10.1007/978-3-319-23201-0_33</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-319-23201-0_33" target="_blank" >10.1007/978-3-319-23201-0_33</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimizing Sorting and Top-k Selection Steps in Permutation Based Indexing on GPUs

Popis výsledku v původním jazyce

Permutation-based indexing is one of the most popular techniques for the approximate nearest-neighbor search problem in high-dimensional spaces. Due to the exponential increase of multimedia data, the time required to index this data has become a seriousconstraint of the indexing techniques. One of the possible steps towards faster index construction is utilization of massively parallel platforms such as the GPGPU architectures. In this paper, we have focused on two particular steps of permutation index construction -- the selection of top-k nearest pivot points and sorting these pivots according to their respective distances. Even though these steps are integrated into a more complex algorithm, we address them selectively since they may be employed individually for different indexing techniques or query processing algorithms in multimedia databases. We also provide a discussion of alternative approaches that we have tested but which have proved less efficient on present hardware.

Název v anglickém jazyce

Optimizing Sorting and Top-k Selection Steps in Permutation Based Indexing on GPUs

Popis výsledku anglicky

Permutation-based indexing is one of the most popular techniques for the approximate nearest-neighbor search problem in high-dimensional spaces. Due to the exponential increase of multimedia data, the time required to index this data has become a seriousconstraint of the indexing techniques. One of the possible steps towards faster index construction is utilization of massively parallel platforms such as the GPGPU architectures. In this paper, we have focused on two particular steps of permutation index construction -- the selection of top-k nearest pivot points and sorting these pivots according to their respective distances. Even though these steps are integrated into a more complex algorithm, we address them selectively since they may be employed individually for different indexing techniques or query processing algorithms in multimedia databases. We also provide a discussion of alternative approaches that we have tested but which have proved less efficient on present hardware.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GP14-14292P" target="_blank" >GP14-14292P: Nasazení moderních paralelních architektur ve specifických oblastech databázových systémů</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

New Trends in Databases and Information Systems

ISBN

978-3-319-23200-3

ISSN

1865-0929

e-ISSN

—

Počet stran výsledku

13

Strana od-do

305-317

Název nakladatele

Springer

Místo vydání

neuveden

Místo konání akce

Poitiers, France

Datum konání akce

8. 9. 2015

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—