kNN query processing in metric spaces using GPUs

52Citations
Citations of this article
17Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Information retrieval from large databases is becoming crucial for many applications in different fields such as content searching in multimedia objects, text retrieval or computational biology. These databases are usually indexed off-line to enable an acceleration of on-line searches. Furthermore, the available parallelism has been exploited using clusters to improve query throughput. Recently some authors have proposed the use of Graphic Processing Units (GPUs) to accelerate brute-force searching algorithms for metric-space databases. In this work we improve existing GPU brute-force implementations and explore the viability of GPUs to accelerate indexing techniques. This exploration includes an interesting discussion about the performance of both brute-force and indexing-based algorithms that takes into account the intrinsic dimensionality of the element of the database. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Barrientos, R. J., Gómez, J. I., Tenllado, C., Matias, M. P., & Marin, M. (2011). kNN query processing in metric spaces using GPUs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6852 LNCS, pp. 380–392). https://doi.org/10.1007/978-3-642-23400-2_35

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free