The DOI matches its Crossref record.
Using graphics processors for high performance IR query processing
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.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
For a query processing application, CPUs are more efficient for queries involving short lists while GPUs are more efficient for those involving long lists.
“For example, Ding et al. [2009] note that for a query processing application, CPUs are more efficient for queries involving short lists while GPUs are more efficient for those involving long lists.”
From A Survey of CPU-GPU Heterogeneous Computing Techniques (2015) · cites this paper as Ding et al. 2009
Citations
Cites
No references could be resolved yet.
Research works printed but not linked: 22
- 10.1145/1277741.1277775 · DOI
- Blelloch G., 1993, Synthesis of Parallel Algorithms, 35
- 10.5555/297805.297827 · DOI
- 10.1145/956863.956944 · DOI · Paper page
- 10.1145/1277741.1277776 · DOI
- 10.1137/0217049 · DOI
- 10.1145/1142473.1142511 · DOI
- 10.1145/1198555.1198787 · DOI
- 10.1145/1454115.1454152 · DOI
- 10.1145/1376616.1376670 · DOI
- S. Heman. Super-scalar database compression between RAM and CPU-cache. MS Thesis Centrum voor Wiskunde en Informatica Amsterdam Netherlands July 2005. S. Heman. Super-scalar database compression between RAM and CPU-cache. MS Thesis Centrum voor Wiskunde en Informatica Amsterdam Netherlands July 2005.
- Heman S., 2006, Proc. of the 15th Text REtrieval Conference (TREC)
- 10.1145/326440.326445 · DOI
- Lawler E., 1993, Elsevier
- 10.1145/237496.237497 · DOI
- Owens J., 2005, Eurographics
- 10.1109/SFCS.1994.365680 · DOI
- 10.5555/951953.952384 · DOI
- Robertson S., 1994, Proc. of the 3rd Text Retrieval Conference (TREC)
- 10.1145/1367497.1367550 · DOI
- 10.1145/1132956.1132959 · DOI
- 10.1109/ICDE.2006.150 · DOI
Cited by
Sorted by citations
A Survey of CPU-GPU Heterogeneous Computing Techniques
Mittal, S., & Vetter, J. S. (2015) · ACM Computing Surveys · doi:10.1145/2788396 · Cited by 568
Metadata
- Authors
- Ding, S., He, J., Yan, H., & Suel, T.
- Affiliations
- Polytechnic Institute of NYU, Brooklyn, NY, USA
- Yahoo! Research, Sunnyvale, CA, USA
- Venue
- Proceedings of the 18th international conference on World wide web
- Publisher
- ACM
- Published
- 2009-04-20
- Pages
- 421-430
- Cited by
- 56
- References
- 0
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review