Range query processing on single and multi GPU environments

Ricardo J. Barrientos

doi:10.1016/j.compeleceng.2013.05.012

Return

Range query processing on single and multi GPU environments

2013-11-01

PRE

Ricardo J. Barrientos *

DOI：10.1016/j.compeleceng.2013.05.012

Original

Original request for help

Save

Abstract

En 中文

Metric-space similarity search has proven suitable in a number of application domains such as multimedia retrieval and computational biology to name a few. These applications usually work on very large databases that are often indexed to speed-up on-line searches. To achieve efficient throughput, it is essential to exploit the intrinsic parallelism in the respective search query processing algorithms. Many strategies have been proposed in the literature to parallelize these algorithms either on shared or distributed memory multiprocessor systems. Lately, GPUs have been used to implement brute-force parallel search strategies instead of using index data structures. Indexing poses difficulties when it comes to achieve efficient exploitation of GPU resources. In this paper we propose single and multi CPU metric space techniques that efficiently exploit CPU tailored index data structures for parallel similarity search in large databases. The experimental results show that our proposal outperforms previous index-based sequential and OpenMP search strategies. (C) 2013 Elsevier Ltd. All rights reserved.

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.