All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GP14-14292P" target="_blank" >GP14-14292P: Employing Modern Parallel Architectures in Specific Domains of Database Systems</a><br>

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    New Trends in Databases and Information Systems

  • ISBN

    978-3-319-23200-3

  • ISSN

    1865-0929

  • e-ISSN

  • Number of pages

    13

  • Pages from-to

    305-317

  • Publisher name

    Springer

  • Place of publication

    neuveden

  • Event location

    Poitiers, France

  • Event date

    Sep 8, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article