Name
Abstract | ||
|---|---|---|
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 serious constraint of current techniques. One of the possible steps towards faster index construction is the 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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-23201-0_33 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Indexing,Permutation,GPU,Top-k,Sorting,Bitonic sort | Exponential function,Computer science,Massively parallel,Permutation,Search engine indexing,Theoretical computer science,Sorting,General-purpose computing on graphics processing units,Search problem,Bitonic sorter | Conference |
Volume | ISSN | Citations |
539 | 1865-0929 | 2 |
PageRank | References | Authors |
0.36 | 5 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Krulis | 1 | 76 | 13.27 |
| Hasmik Osipyan | 2 | 11 | 2.65 |
| Stéphane Marchand-Maillet | 3 | 1039 | 104.97 |