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”

Perils of Combining Parallel Distance Computations with Metric and Ptolemaic Indexing in kNN Queries

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F14%3A10281374" target="_blank" >RIV/00216208:11320/14:10281374 - isvavai.cz</a>

  • Result on the web

    <a href="http://link.springer.com/chapter/10.1007/978-3-319-11988-5_12" target="_blank" >http://link.springer.com/chapter/10.1007/978-3-319-11988-5_12</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-3-319-11988-5_12" target="_blank" >10.1007/978-3-319-11988-5_12</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Perils of Combining Parallel Distance Computations with Metric and Ptolemaic Indexing in kNN Queries

  • Original language description

    Similarity search methods face serious performance issues since similarity functions are rather expensive to compute. Many optimization techniques were designed to reduce the number of similarity computations, when a query is being resolved. Indexing methods, like pivot table prefiltering, based on the metric properties of feature space, are one of the most popular methods. They can increase the speed of query evaluation even by orders of magnitude. Another approach is to employ highly parallel architectures like GPUs to accelerate evaluation by unleashing their raw computational power. Unfortunately, resolving the k~nearest neighbors (kNN) queries optimized with metric indexing is a problem that is serial in nature. In this paper, we explore the perils of kNN parallelization and we propose a new algorithm that basically converts kNN queries into range queries, which are perfectly parallelizable. We have experimentally evaluated all approaches using a~highly parallel environment compri

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2014

  • 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

    Similarity Search and Applications

  • ISBN

    978-3-319-11987-8

  • ISSN

    0302-9743

  • e-ISSN

  • Number of pages

    12

  • Pages from-to

    127-138

  • Publisher name

    Springer Berlin Heidelberg

  • Place of publication

    Heidelberg, Germany

  • Event location

    Los Cabos, Mexiko

  • Event date

    Oct 29, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article