{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:03:22Z","timestamp":1742969002338,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030352240"},{"type":"electronic","value":"9783030352257"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-35225-7_16","type":"book-chapter","created":{"date-parts":[[2019,11,19]],"date-time":"2019-11-19T13:04:56Z","timestamp":1574168696000},"page":"240-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Scalable Top-K Query Processing Using Graphics Processing Unit"],"prefix":"10.1007","author":[{"given":"Yulin","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Fang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,15]]},"reference":[{"key":"16_CR1","unstructured":"Adinetz, A.: CUDA pro tip: optimized filtering with warp-aggregated atomics. Parallel Forall. Np (2014)"},{"issue":"8","key":"16_CR2","doi-asserted-by":"publisher","first-page":"470","DOI":"10.14778\/2002974.2002975","volume":"4","author":"N Ao","year":"2011","unstructured":"Ao, N., et al.: Efficient parallel lists intersection and index compression algorithms using graphics processing units. Proc. VLDB Endow. 4(8), 470\u2013481 (2011)","journal-title":"Proc. VLDB Endow."},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Asadi, N., Lin, J.: Effectiveness\/efficiency tradeoffs for candidate generation in multi-stage retrieval architectures. In: Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 997\u20131000. ACM (2013)","DOI":"10.1145\/2484028.2484132"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MM.2003.1196112","volume":"23","author":"LA Barroso","year":"2003","unstructured":"Barroso, L.A., Dean, J., Holzle, U.: Web search for a planet: the Google cluster architecture. IEEE Micro 23(2), 22\u201328 (2003)","journal-title":"IEEE Micro"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Broder, A.Z., Carmel, D., Herscovici, M., Soffer, A., Zien, J.: Efficient query evaluation using a two-level retrieval process. In: Proceedings of the twelfth International Conference on Information and Knowledge Management, pp. 426\u2013434. ACM (2003)","DOI":"10.1145\/956863.956944"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Buckley, C., Lewit, A.F.: Optimization of inverted vector searches. In: Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 97\u2013110. ACM (1985)","DOI":"10.1145\/253495.253515"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcttcher, S., Clarke, C.L.: Index compression is good, especially for random access. In: Proceedings of the Sixteenth ACM Conference on Information and Knowledge Management, pp. 761\u2013770. ACM (2007)","DOI":"10.1145\/1321440.1321546"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Ding, S., He, J., Yan, H., Suel, T.: Using graphics processors for high performance IR query processing. In: Proceedings of the 18th International Conference on World Wide Web, pp. 421\u2013430. ACM (2009)","DOI":"10.1145\/1526709.1526766"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Ding, S., Suel, T.: Faster top-k document retrieval using block-max indexes. In: Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 993\u20131002. ACM (2011)","DOI":"10.1145\/2009916.2010048"},{"issue":"39","key":"16_CR10","first-page":"851","volume":"3","author":"M Harris","year":"2007","unstructured":"Harris, M., Sengupta, S., Owens, J.D.: Parallel prefix sum (scan) with CUDA. GPU Gems 3(39), 851\u2013876 (2007)","journal-title":"GPU Gems"},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/1620585.1620588","volume":"34","author":"B He","year":"2009","unstructured":"He, B., et al.: Relational query coprocessing on graphics processors. ACM Trans. Database Syst. (TODS) 34(4), 21 (2009)","journal-title":"ACM Trans. Database Syst. (TODS)"},{"key":"16_CR12","unstructured":"Hoberock, J., Bell, N.: Thrust: a parallel template library (2010)"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1006\/jpdc.2001.1808","volume":"62","author":"SJ Lee","year":"2002","unstructured":"Lee, S.J., Jeon, M., Kim, D., Sohn, A.: Partitioned parallel radix sort. J. Parallel Distrib. Comput. 62(4), 656\u2013668 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"16_CR14","unstructured":"Lichterman, D.: Course project for UIUC ECE 498 AL: programming massively parallel processors. Wen-Mei Hwu and David Kirk, instructors (2007)"},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"584","DOI":"10.1007\/s10791-012-9209-9","volume":"16","author":"C Macdonald","year":"2013","unstructured":"Macdonald, C., Santos, R.L., Ounis, I.: The whens and hows of learning to rank for web search. Inf. Retrieval 16(5), 584\u2013628 (2013)","journal-title":"Inf. Retrieval"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Robertson, S.E., Walker, S., Jones, S., Hancock-Beaulieu, M.M., Gatford, M., et al.: Okapi at TREC-3. NIST Special Publication SP, p. 109 (1995)","DOI":"10.6028\/NIST.SP.500-225.routing-city"},{"key":"16_CR17","unstructured":"Schurman, E., Brutlag, J.: Performance related changes and their user impact. In: Velocity Web Performance and Operations Conference (2009)"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Sengupta, S., Harris, M., Garland, M., Owens, J.D.: Efficient parallel scan algorithms for many-core GPUs. In: Scientific Computing with Multicore and Accelerators, pp. 413\u2013442 (2011)","DOI":"10.1201\/b10376-29"},{"key":"16_CR19","unstructured":"Shams, R., Kennedy, R., et al.: Efficient histogram algorithms for NVIDIA CUDA compatible devices. In: Proceedings of the International Conference on Signal Processing and Communications Systems (ICSPCS), pp. 418\u2013422. Citeseer (2007)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Tatikonda, S., Cambazoglu, B.B., Junqueira, F.P.: Posting list intersection on multicore architectures. In: Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 963\u2013972. ACM (2011)","DOI":"10.1145\/2009916.2010045"},{"key":"16_CR21","doi-asserted-by":"crossref","unstructured":"Tonellotto, N., Macdonald, C., Ounis, I.: Efficient and effective retrieval using selective pruning. In: Proceedings of the Sixth ACM International Conference on Web Search and Data Mining, pp. 63\u201372. ACM (2013)","DOI":"10.1145\/2433396.2433407"},{"issue":"6","key":"16_CR22","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/0306-4573(95)00020-H","volume":"31","author":"H Turtle","year":"1995","unstructured":"Turtle, H., Flood, J.: Query evaluation: strategies and optimizations. Inf. Process. Manag. 31(6), 831\u2013850 (1995)","journal-title":"Inf. Process. Manag."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Wang, L., Lin, J., Metzler, D.: A cascade ranking model for efficient ranked retrieval. In: Proceedings of the 34th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 105\u2013114. ACM (2011)","DOI":"10.1145\/2009916.2009934"},{"key":"16_CR24","unstructured":"Wu, D., Zhang, F., Ao, N., Wang, G., Liu, J., Liu, J.: Efficient lists intersection by CPU-GPU cooperative computing. In: 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Ph.D. Forum (IPDPSW), pp. 1\u20138. IEEE (2010)"},{"key":"16_CR25","doi-asserted-by":"crossref","unstructured":"Wu, H., Fang, H.: Document prioritization for scalable query processing. In: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, pp. 1609\u20131618. ACM (2014)","DOI":"10.1145\/2661829.2661914"},{"key":"16_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, J., Long, X., Suel, T.: Performance of compressed inverted list caching in search engines. In: Proceedings of the 17th International Conference on World Wide Web, pp. 387\u2013396. ACM (2008)","DOI":"10.1145\/1367497.1367550"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Zukowski, M., Heman, S., Nes, N., Boncz, P.: Super-scalar RAM-CPU cache compression. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 59. IEEE (2006)","DOI":"10.1109\/ICDE.2006.150"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-35225-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,27]],"date-time":"2024-07-27T08:11:26Z","timestamp":1722067886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-35225-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030352240","9783030352257"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-35225-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LCPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Languages and Compilers for Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"College Station, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/parasol.tamu.edu\/lcpc2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Hotcrp.com","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}