{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T15:57:00Z","timestamp":1762012620079,"version":"build-2065373602"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1849559"],"award-info":[{"award-number":["1849559"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002661","name":"Fonds De La Recherche Scientifique - FNRS","doi-asserted-by":"publisher","award":["MISU F 6001 1"],"award-info":[{"award-number":["MISU F 6001 1"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,7]]},"DOI":"10.1145\/3329785.3329926","type":"proceedings-article","created":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T13:52:32Z","timestamp":1561384352000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Accelerating the Unacceleratable"],"prefix":"10.1145","author":[{"given":"Michael","family":"Gowanlock","sequence":"first","affiliation":[{"name":"Northern Arizona University, School of Informatics, Computing, and Cyber Systems, Flagstaff, AZ, U.S.A."}]},{"given":"Ben","family":"Karsin","sequence":"additional","affiliation":[{"name":"Universit\u00e9 libre de Bruxelles, Department of Computer Science, Brussels, Belgium"}]},{"given":"Zane","family":"Fink","sequence":"additional","affiliation":[{"name":"Northern Arizona University, School of Informatics, Computing, and Cyber Systems, Flagstaff, AZ, U.S.A."}]},{"given":"Jordan","family":"Wright","sequence":"additional","affiliation":[{"name":"Northern Arizona University, School of Informatics, Computing, and Cyber Systems, Flagstaff, AZ, U.S.A."}]}],"member":"320","published-online":{"date-parts":[[2019,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Nathan Bell and Jared Hoberock. 2012. Thrust: a productivity-oriented library for CUDA. GPU Computing Gems: Jade Ed. (2012).  Nathan Bell and Jared Hoberock. 2012. Thrust: a productivity-oriented library for CUDA. GPU Computing Gems: Jade Ed. (2012).","DOI":"10.1016\/B978-0-12-385963-1.00026-5"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2018.00116"},{"key":"e_1_3_2_1_4_1","unstructured":"Christian B\u00f6hm Robert Noll Claudia Plant and Andrew Zherdin. 2009. Index-supported Similarity Join on Graphics Processors. In BTW. 57--66.  Christian B\u00f6hm Robert Noll Claudia Plant and Andrew Zherdin. 2009. Index-supported Similarity Join on Graphics Processors. In BTW. 57--66."},{"key":"e_1_3_2_1_5_1","unstructured":"Rohit Chandra Leo Dagum David Kohr Ramesh Menon Dror Maydan and Jeff McDonald. 2001. Parallel programming in OpenMP. Morgan Kaufmann.   Rohit Chandra Leo Dagum David Kohr Ramesh Menon Dror Maydan and Jeff McDonald. 2001. Parallel programming in OpenMP. Morgan Kaufmann."},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen Thomas H.","unstructured":"Thomas H. Cormen , Charles E. Leiserson , Ronald L. Rivest , and Clifford Stein . 2009. Introduction to Algorithms , Third Edition (3 rd ed.). The MIT Press . Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2009. Introduction to Algorithms, Third Edition (3rd ed.). The MIT Press.","edition":"3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626412500089"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526766"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920927"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2017.37"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804339"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3183734"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646669.701092"},{"key":"e_1_3_2_1_14_1","series-title":"SIAM J. Comput. (1997), 638--648","volume-title":"The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms","author":"Gibbons Phillip B","unstructured":"Phillip B Gibbons , Yossi Matias , and Vijaya Ramachandran . 1997. The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms . SIAM J. Comput. (1997), 638--648 . Phillip B Gibbons, Yossi Matias, and Vijaya Ramachandran. 1997. The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms. SIAM J. Comput. (1997), 638--648."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.01.004"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304621"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/asi.10268"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1816038.1815998"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3079079.3079105"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/645505.656447"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/HiPC.2015.40"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3205289.3205298"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2347041"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.03.015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/HIPC.2009.5433179"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2010.5470444"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497520"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2004.1297303"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2788396"},{"key":"e_1_3_2_1_30_1","volume-title":"Parallel Tree Traversal for Nearest Neighbor Query on the GPU. In 45th Intl. Conf. on Parallel Processing. 113--122","author":"Nam Moohyeon","year":"2016","unstructured":"Moohyeon Nam , Jinwoong Kim , and Beomseok Nam . 2016 . Parallel Tree Traversal for Nearest Neighbor Query on the GPU. In 45th Intl. Conf. on Parallel Processing. 113--122 . Moohyeon Nam, Jinwoong Kim, and Beomseok Nam. 2016. Parallel Tree Traversal for Nearest Neighbor Query on the GPU. In 45th Intl. Conf. on Parallel Processing. 113--122."},{"key":"e_1_3_2_1_31_1","unstructured":"NVIDIA. 2017. CUDA Programming Guide 9.0. http:\/\/docs.nvidia.com\/cuda Accessed: 17-05-2019.  NVIDIA. 2017. CUDA Programming Guide 9.0. http:\/\/docs.nvidia.com\/cuda Accessed: 17-05-2019."},{"key":"e_1_3_2_1_32_1","unstructured":"NVIDIA. 2017. Volta. http:\/\/images.nvidia.com\/content\/volta-architecture\/pdf\/volta-architecture-whitepaper.pdf Accessed: 31-01-2019.  NVIDIA. 2017. Volta. http:\/\/images.nvidia.com\/content\/volta-architecture\/pdf\/volta-architecture-whitepaper.pdf Accessed: 31-01-2019."},{"key":"e_1_3_2_1_33_1","unstructured":"PCI-SIG. 2017. PCI-SIG DevCon 2017 Update. https:\/\/pcisig.com\/sites\/default\/files\/files\/PCI-SIG%20DevCon%202017%20Press%20Deck.pdf Accessed: 23-02-2019.  PCI-SIG. 2017. PCI-SIG DevCon 2017 Update. https:\/\/pcisig.com\/sites\/default\/files\/files\/PCI-SIG%20DevCon%202017%20Press%20Deck.pdf Accessed: 23-02-2019."},{"volume-title":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD '14)","author":"Polychroniou Orestis","key":"e_1_3_2_1_34_1","unstructured":"Orestis Polychroniou and Kenneth A. Ross . 2014. A Comprehensive Study of Main-memory Partitioning and Its Application to Large-scale Comparison- and Radix-sort . In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD '14) . 755--766. Orestis Polychroniou and Kenneth A. Ross. 2014. A Comprehensive Study of Main-memory Partitioning and Its Application to Large-scale Comparison- and Radix-sort. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD '14). 755--766."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2015.127"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161068"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1370082.1370089"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(02)00196-2"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4379(95)00011-R"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"}],"event":{"name":"SIGMOD\/PODS '19: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Amsterdam Netherlands","acronym":"SIGMOD\/PODS '19"},"container-title":["Proceedings of the 15th International Workshop on Data Management on New Hardware"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3329785.3329926","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3329785.3329926","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3329785.3329926","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:26:22Z","timestamp":1750206382000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3329785.3329926"}},"subtitle":["Hybrid CPU\/GPU Algorithms for Memory-Bound Database Primitives"],"short-title":[],"issued":{"date-parts":[[2019,7]]},"references-count":40,"alternative-id":["10.1145\/3329785.3329926","10.1145\/3329785"],"URL":"https:\/\/doi.org\/10.1145\/3329785.3329926","relation":{},"subject":[],"published":{"date-parts":[[2019,7]]},"assertion":[{"value":"2019-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}