GPU-accelerated block-max query processing

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

Abstract

In this paper, we propose a method for parallel top-k query processing on GPU(s). We employ a novel partitioning strategy which splits the posting lists according to document ID numbers. Individual GPU threads simultaneously perform top-k query processing within their allocated subsets of posting lists, the results of the query are merged to give the final top-k results. We further design a CPU-GPU cooperative query processing method, where a majority of queries involving shorter posting lists are processed on the GPU side. We experiment with AND, OR, WAND, and Block-Max WAND (BMW) queries, with experimental results showing a promising improvement in query throughput, particularly in the case of BMW queries.

Cite

CITATION STYLE

APA

Huang, H., Ren, M., Zhao, Y., Stones, R. J., Zhang, R., Wang, G., & Liu, X. (2017). GPU-accelerated block-max query processing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10393 LNCS, pp. 225–238). Springer Verlag. https://doi.org/10.1007/978-3-319-65482-9_15

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