{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:44Z","timestamp":1750307084194,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,12]],"date-time":"2012-08-12T00:00:00Z","timestamp":1344729600000},"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":[[2012,8,12]]},"DOI":"10.1145\/2339530.2339757","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"1451-1459","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["Efficient frequent item counting in multi-core hardware"],"prefix":"10.1145","author":[{"given":"Pratanu","family":"Roy","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Teubner","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo","family":"Alonso","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8,12]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proc. VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules in large databases . In Proc. VLDB , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. VLDB, 1994."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629575.1629579"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989328"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1761"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454225"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687653"},{"key":"e_1_3_2_2_7_1","volume-title":"Workshop on Edge Computing Using New Commodity Architectures","author":"Dubey P.","year":"2006","unstructured":"P. Dubey . Teraflops for the masses: Killer apps of tomorrow . In Workshop on Edge Computing Using New Commodity Architectures , 2006 . P. Dubey. Teraflops for the masses: Killer apps of tomorrow. In Workshop on Edge Computing Using New Commodity Architectures, 2006."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1345206.1345215"},{"key":"e_1_3_2_2_9_1","volume-title":"USA","author":"Howard J.","year":"2010","unstructured":"J. Howard , S. Dighe , Y. Hoskote , S. Vangal , D. Finan , G. Ruhl , D. Jenkins , H. Wilson , N. Borkar , G. Schrom , F. Pailet , S. Jain , T. Jacob , S. Yada , S. Marella , P. Salihundam , V. Erraguntla , M. Konow , M. Riepen , G. Droege , J. Lindemann , M. Gries , T. Apel , K. Henriss , T. Lund-Larsen , S. Steibl , S. Borkar , V. De , R. V. D. Wijngaart , and T. Mattson . A 48-core IA-32 message-passing processor with DVFS in 45nm CMOS. In 2010 IEEE Int'l Solid-State Circuits Conf., San Francisco, CA , USA , 2010 . J. Howard, S. Dighe, Y. Hoskote, S. Vangal, D. Finan, G. Ruhl, D. Jenkins, H. Wilson, N. Borkar, G. Schrom, F. Pailet, S. Jain, T. Jacob, S. Yada, S. Marella, P. Salihundam, V. Erraguntla, M. Konow, M. Riepen, G. Droege, J. Lindemann, M. Gries, T. Apel, K. Henriss, T. Lund-Larsen, S. Steibl, S. Borkar, V. De, R. V. D. Wijngaart, and T. Mattson. A 48-core IA-32 message-passing processor with DVFS in 45nm CMOS. In 2010 IEEE Int'l Solid-State Circuits Conf., San Francisco, CA, USA, 2010."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687564"},{"key":"e_1_3_2_2_11_1","volume-title":"Sparse Matrix Proceedings","author":"Kung H. T.","year":"1978","unstructured":"H. T. Kung and C. E. Leiserson . Systolic arrays (for VLSI) . In Sparse Matrix Proceedings , Knoxville, TN, USA , 1978 . H. T. Kung and C. E. Leiserson. Systolic arrays (for VLSI). In Sparse Matrix Proceedings, Knoxville, TN, USA, 1978."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/582250.582267"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1019210"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.datak.2008.11.001"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166084"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2009.22"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/GCC.2008.100"},{"key":"e_1_3_2_2_18_1","volume-title":"ADMS Workshop","author":"Schlegel B.","year":"2011","unstructured":"B. Schlegel , T. Willhalm , and W. Lehner . Fast sorted-set intersection using SIMD instructions . In ADMS Workshop , Seattle, WA, USA , 2011 . B. Schlegel, T. Willhalm, and W. Lehner. Fast sorted-set intersection using SIMD instructions. In ADMS Workshop, Seattle, WA, USA, 2011."},{"key":"e_1_3_2_2_19_1","volume-title":"Proc. VLDB","author":"Shatdal A.","year":"1994","unstructured":"A. Shatdal , C. Kant , and J. F. Naughton . Cache conscious algorithms for relational query processing . In Proc. VLDB , 1994 . A. Shatdal, C. Kant, and J. F. Naughton. Cache conscious algorithms for relational query processing. In Proc. VLDB, 1994."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.250104"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989389"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2010.5447856"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687671"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1995441.1995442"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.150"}],"event":{"name":"KDD '12: The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Beijing China","acronym":"KDD '12"},"container-title":["Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339757","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2339530.2339757","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:18Z","timestamp":1750239258000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2339530.2339757"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,12]]},"references-count":25,"alternative-id":["10.1145\/2339530.2339757","10.1145\/2339530"],"URL":"https:\/\/doi.org\/10.1145\/2339530.2339757","relation":{},"subject":[],"published":{"date-parts":[[2012,8,12]]},"assertion":[{"value":"2012-08-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}