ACM Home Page
Please provide us with feedback. Feedback
Using graphics processors for high performance IR query processing
Full text PdfPdf (1.13 MB)
Source
International World Wide Web Conference archive
Proceedings of the 18th international conference on World wide web table of contents
Madrid, Spain
SESSION: Search/session: query processing table of contents
Pages 421-430  
Year of Publication: 2009
ISBN:978-1-60558-487-4
Authors
Shuai Ding  Polytechnic Institute of NYU, Brooklyn, NY, USA
Jinru He  Polytechnic Institute of NYU, Brooklyn, NY, USA
Hao Yan  Polytechnic Institute of NYU, Brooklyn, NY, USA
Torsten Suel  Yahoo! Research, Sunnyvale, CA, USA
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 34,   Downloads (12 Months): 119,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1526709.1526766
What is a DOI?

ABSTRACT

Web search engines are facing formidable performance challenges due to data sizes and query loads. The major engines have to process tens of thousands of queries per second over tens of billions of documents. To deal with this heavy workload, such engines employ massively parallel systems consisting of thousands of machines. The significant cost of operating these systems has motivated a lot of recent research into more efficient query processing mechanisms. We investigate a new way to build such high performance IR systems using graphical processing units (GPUs). GPUs were originally designed to accelerate computer graphics applications through massive on-chip parallelism. Recently a number of researchers have studied how to use GPUs for other problem domains such as databases and scientific computing. Our contribution here is to design a basic system architecture for GPU-based high-performance IR, to develop suitable algorithms for subtasks such as inverted list compression, list intersection, and top-$k$ scoring, and to show how to achieve highly efficient query processing on GPU-based systems. Our experimental results for a prototype GPU-based system on $25.2$ million web pages indicate that significant gains in query processing performance can be obtained.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Nvidia CUDA programming guide, June 2007. http://www.nvidia.com/object/cuda develop.html.
2
 
3
G. Blelloch. Prefix sums and their applications. In J. H. Reif, editor, Synthesis of Parallel Algorithms, pages 35--60, 1993.
 
4
5
6
 
7
8
9
 
10
M. Harris. Parallel prefix sum (scan) with CUDA, April 2007. http://developer.download.nvidia.com/compute/cuda/sdk/website/projects/scan/doc/scan.pdf.
11
12
 
13
S. Heman. Super-scalar database compression between RAM and CPU-cache. MS Thesis, Centrum voor Wiskunde en Informatica, Amsterdam, Netherlands, July 2005.
 
14
S. Heman, M. Zukowski, A. de Vries, and P. Boncz. MonetDBX100 at the 2006 TREC Terabyte Track. In Proc. of the 15th Text REtrieval Conference (TREC), 2006.
15
 
16
E. Lawler, J. Lenstra, A. Kan, and D. Shmoys. Sequencing and scheduling: algorithms and complexity. Elsevier, 1993.
 
17
D. Lichterman. Course project for ECE498, Univ. of Illinois at Urbana-Champaign. http://courses.ece.uiuc.edu/ece498/al1/Archive/Spring2007/HallOfFame.html.
18
 
19
J. Owens, D. Luebke, N. Govindaraju, M. Harris, J. Kruger, A. Lefohn, and T. Purcell. A survey of general-purpose computation on graphics hardware. In Eurographics, 2005.
 
20
 
21
 
22
S. Robertson, S. Walker, S. Jones, M. Hancock-Beaulieu, and M. Gatford. Okapi at trec-3. In Proc. of the 3rd Text Retrieval Conference (TREC), Nov 1994.
23
24
 
25

Collaborative Colleagues:
Shuai Ding: colleagues
Jinru He: colleagues
Hao Yan: colleagues
Torsten Suel: colleagues