{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T02:22:24Z","timestamp":1773886944165,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,5,27]],"date-time":"2015-05-27T00:00:00Z","timestamp":1432684800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,27]]},"DOI":"10.1145\/2723372.2747644","type":"proceedings-article","created":{"date-parts":[[2015,6,2]],"date-time":"2015-06-02T05:35:02Z","timestamp":1433223302000},"page":"1123-1136","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":39,"title":["Cache-Efficient Aggregation"],"prefix":"10.1145","author":[{"given":"Ingo","family":"M\u00fcller","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology \/ SAP SE, Karlsruhe \/ Walldorf, Germany"}]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}]},{"given":"Arnaud","family":"Lacurie","sequence":"additional","affiliation":[{"name":"SAP SE, Walldorf, Germany"}]},{"given":"Wolfgang","family":"Lehner","sequence":"additional","affiliation":[{"name":"Dresden University of Technology, Dresden, Germany"}]},{"given":"Franz","family":"F\u00e4rber","sequence":"additional","affiliation":[{"name":"SAP SE, Walldorf, Germany"}]}],"member":"320","published-online":{"date-parts":[[2015,5,27]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/48529.48535"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336678"},{"key":"e_1_3_2_1_4_1","first-page":"334","volume-title":"BRICS","author":"Arge L.","year":"1996","unstructured":"L. Arge . The Buffer Tree: A New Technique for Optimal I\/O-Algorithms . BRICS , pages 334 -- 345 , 1996 . L. Arge. The Buffer Tree: A New Technique for Optimal I\/O-Algorithms. BRICS, pages 334--345, 1996."},{"key":"e_1_3_2_1_5_1","first-page":"1","volume-title":"Handbook of Data Structures and Applications","author":"Arge L.","year":"2005","unstructured":"L. Arge , G. S. l. Brodal , and R. Fagerberg . Cache-Oblivious Data Structures . In Handbook of Data Structures and Applications , pages 38\/ 1 -- 38 \/28. 2005 . L. Arge, G. S. l. Brodal, and R. Fagerberg. Cache-Oblivious Data Structures. In Handbook of Data Structures and Applications, pages 38\/1--38\/28. 2005."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378573"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732227"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735496.2735499"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/319983.319987"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050076"},{"key":"e_1_3_2_1_11_1","first-page":"225","volume-title":"CIDR","author":"Boncz P. A.","year":"2005","unstructured":"P. A. Boncz , M. Zukowski , and N. Nes . MonetDB\/X100: Hyper-Pipelining Query Execution . In CIDR , pages 225 -- 237 , 2005 . P. A. Boncz, M. Zukowski, and N. Nes. MonetDB\/X100: Hyper-Pipelining Query Execution. In CIDR, pages 225--237, 2005."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593662"},{"key":"e_1_3_2_1_13_1","first-page":"339","volume-title":"PVLDB","author":"Cieslewicz J.","year":"2007","unstructured":"J. Cieslewicz and K. Ross . Adaptive Aggregation on Chip Multiprocessors . In PVLDB , pages 339 -- 350 , 2007 . J. Cieslewicz and K. Ross. Adaptive Aggregation on Chip Multiprocessors. In PVLDB, pages 339--350, 2007."},{"key":"e_1_3_2_1_14_1","volume-title":"Introduction To Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction To Algorithms . MIT Press , 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction To Algorithms. MIT Press, 2001."},{"key":"e_1_3_2_1_15_1","volume-title":"page 29","author":"Demaine E. D.","year":"2002","unstructured":"E. D. Demaine . Cache-Oblivious Algorithms and Data Structures . BRICS , page 29 , 2002 . E. D. Demaine. Cache-Oblivious Algorithms and Data Structures. BRICS, page 29, 2002."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602261"},{"issue":"1","key":"e_1_3_2_1_17_1","first-page":"22","article-title":"Larson","volume":"37","author":"Freedman C.","year":"2014","unstructured":"C. Freedman , E. Ismert , and P.-A. k . Larson . Compilation in the Microsoft SQL Server Hekaton Engine. IEEE Data Eng. Bull. , 37 ( 1 ): 22 -- 30 , 2014 . C. Freedman, E. Ismert, and P.-A. k. Larson. Compilation in the Microsoft SQL Server Hekaton Engine. IEEE Data Eng. Bull., 37(1):22--30, 2014.","journal-title":"Compilation in the Microsoft SQL Server Hekaton Engine. IEEE Data Eng. Bull."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796479"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/152610.152611"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00450-011-0186-9"},{"key":"e_1_3_2_1_21_1","first-page":"86","volume-title":"PVLDB","author":"Graefe G.","year":"1998","unstructured":"G. Graefe , R. Bunker , and S. Cooper . Hash Joins and Hash Teams in Microsoft SQL Server . In PVLDB , pages 86 -- 97 , 1998 . G. Graefe, R. Bunker, and S. Cooper. Hash Joins and Hash Teams in Microsoft SQL Server. In PVLDB, pages 86--97, 1998."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/645481.655593"},{"key":"e_1_3_2_1_23_1","volume-title":"Early Grouping Gets the Skew. Technical report","author":"Helmer S.","year":"2011","unstructured":"S. Helmer , T. Neumann , and G. Moerkotte . Early Grouping Gets the Skew. Technical report , 2011 . S. Helmer, T. Neumann, and G. Moerkotte. Early Grouping Gets the Skew. Technical report, 2011."},{"key":"e_1_3_2_1_24_1","volume-title":"Intel\u00ae 64 and IA-32 Architectures Optimization Reference Manual","author":"Intel Corporation","year":"2009","unstructured":"Intel Corporation . Intel\u00ae 64 and IA-32 Architectures Optimization Reference Manual . 2009 . Intel Corporation. Intel\u00ae 64 and IA-32 Architectures Optimization Reference Manual. 2009."},{"key":"e_1_3_2_1_25_1","first-page":"101","volume-title":"PDP","author":"Jimenez-Gonzalez D.","year":"2003","unstructured":"D. Jimenez-Gonzalez , J. Navarro , and J.-L. Larriba-Pey . CC-Radix : a cache conscious sorting based on Radix sort . In PDP , pages 101 -- 108 . IEEE, 2003 . D. Jimenez-Gonzalez, J. Navarro, and J.-L. Larriba-Pey. CC-Radix: a cache conscious sorting based on Radix sort. In PDP, pages 101--108. IEEE, 2003."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687564"},{"key":"e_1_3_2_1_27_1","volume-title":"Grouping and duplicate elimination: Benefits of early aggregation. Technical report","author":"Larson P.-k.","year":"1997","unstructured":"P.-k. Larson . Grouping and duplicate elimination: Benefits of early aggregation. Technical report , 1997 . P.-k. Larson. Grouping and duplicate elimination: Benefits of early aggregation. Technical report, 1997."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610507"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/1881923.1881936"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1019210"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/1316689.1316749"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780000031"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704446554"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732977.2732984"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2002938.2002940"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610522"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536233"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807207"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/223784.223801"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2247596.2247646"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/384192.384193"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/2033408.2033427"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.29490"},{"key":"e_1_3_2_1_44_1","unstructured":"J. Wen. Revisiting aggregation techniques for data intensive applications. PhD thesis 2013.   J. Wen. Revisiting aggregation techniques for data intensive applications. PhD thesis 2013."},{"key":"e_1_3_2_1_45_1","volume-title":"Integer sorting -- Wikipedia, the free encyclopedia","year":"2015","unstructured":"Wikipedia. Integer sorting -- Wikipedia, the free encyclopedia , 2015 . {Online; accessed 22-January-2015}. Wikipedia. Integer sorting -- Wikipedia, the free encyclopedia, 2015. {Online; accessed 22-January-2015}."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995441.1995442"}],"event":{"name":"SIGMOD\/PODS'15: International Conference on Management of Data","location":"Melbourne Victoria Australia","acronym":"SIGMOD\/PODS'15","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2747644","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2723372.2747644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:38Z","timestamp":1750227398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2723372.2747644"}},"subtitle":["Hashing Is Sorting"],"short-title":[],"issued":{"date-parts":[[2015,5,27]]},"references-count":45,"alternative-id":["10.1145\/2723372.2747644","10.1145\/2723372"],"URL":"https:\/\/doi.org\/10.1145\/2723372.2747644","relation":{},"subject":[],"published":{"date-parts":[[2015,5,27]]},"assertion":[{"value":"2015-05-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}