{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:57:29Z","timestamp":1750309049582,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":29,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3216122.3216156","type":"proceedings-article","created":{"date-parts":[[2018,7,10]],"date-time":"2018-07-10T16:26:42Z","timestamp":1531240002000},"page":"226-235","source":"Crossref","is-referenced-by-count":0,"title":["On Improving Data Skew Resilience In Main-memory Hash Joins"],"prefix":"10.1145","author":[{"given":"Puya","family":"Memarzia","sequence":"first","affiliation":[{"name":"Univeristy of New Brunswick, Fredericton, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suprio","family":"Ray","sequence":"additional","affiliation":[{"name":"Univeristy of New Brunswick, Fredericton, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Virendra C","family":"Bhavsar","sequence":"additional","affiliation":[{"name":"Univeristy of New Brunswick, Fredericton, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3216122.3216156-1","doi-asserted-by":"crossref","unstructured":"D. A. F. Alcantara. Efficient Hash Tables on the GPU. PhD thesis, University of California, Davis, 2011.","DOI":"10.1016\/B978-0-12-385963-1.00004-6"},{"key":"key-10.1145\/3216122.3216156-2","doi-asserted-by":"crossref","unstructured":"Y. Arbitman, M. Naor, and G. Segev. De-amortized cuckoo hashing: Provable worst-case performance and experimental results. ICALP, pages 107--118, 2009.","DOI":"10.1007\/978-3-642-02927-1_11"},{"key":"key-10.1145\/3216122.3216156-3","doi-asserted-by":"crossref","unstructured":"C. Balkesen, G. Alonso, J. Teubner, and M. T. &#214;zsu. Multi-core, main-memory joins: Sort vs. hash revisited. VLDBJ, pages 85--96, 2013.","DOI":"10.14778\/2732219.2732227"},{"key":"key-10.1145\/3216122.3216156-4","doi-asserted-by":"crossref","unstructured":"C. Balkesen, J. Teubner, G. Alonso, and M. T. &#214;zsu. Main-memory hash joins on multi-core cpus: Tuning to the underlying hardware. In ICDE, pages 362--373. IEEE, 2013.","DOI":"10.1109\/ICDE.2013.6544839"},{"key":"key-10.1145\/3216122.3216156-5","doi-asserted-by":"crossref","unstructured":"&#199;. Balkesen, J. Teubner, G. Alonso, and M. T. &#214;zsu. Main-memory hash joins on modern processor architectures. TKDE, pages 1754--1766, 2015.","DOI":"10.1109\/TKDE.2014.2313874"},{"key":"key-10.1145\/3216122.3216156-6","doi-asserted-by":"crossref","unstructured":"R. Barber, G. Lohman, I. Pandis, V. Raman, R. Sidle, G. Attaluri, N. Chainani, S. Lightstone, and D. Sharpe. Memory-efficient hash joins. VLDBJ, pages 353--364, 2014.","DOI":"10.14778\/2735496.2735499"},{"key":"key-10.1145\/3216122.3216156-7","doi-asserted-by":"crossref","unstructured":"P. Beame, P. Koutris, and D. Suciu. Skew in parallel query processing. In PODS, pages 212--223. ACM, 2014.","DOI":"10.1145\/2594538.2594558"},{"key":"key-10.1145\/3216122.3216156-8","doi-asserted-by":"crossref","unstructured":"S. Blanas, Y. Li, and J. M. Patel. Design and evaluation of main memory hash join algorithms for multi-core cpus. In SIGMOD, pages 37--48. ACM, 2011.","DOI":"10.1145\/1989323.1989328"},{"key":"key-10.1145\/3216122.3216156-9","unstructured":"T. P. P. Council. Tpc-h benchmark specification. Published at http:\/\/www.tcp.org\/hspec.html, pages 592--603, 2008."},{"key":"key-10.1145\/3216122.3216156-10","doi-asserted-by":"crossref","unstructured":"A. Crolotte and A. Ghazal. Introducing Skew into the TPC-H Benchmark. In TPCTC, pages 137--145, 2012.","DOI":"10.1007\/978-3-642-32627-1_10"},{"key":"key-10.1145\/3216122.3216156-11","doi-asserted-by":"crossref","unstructured":"B. Cutt and R. Lawrence. Improving join performance for skewed databases. In CCECE, pages 387--392. IEEE, 2008.","DOI":"10.1109\/CCECE.2008.4564563"},{"key":"key-10.1145\/3216122.3216156-12","unstructured":"B. Fan, D. G. Andersen, and M. Kaminsky. Memc3: Compact and concurrent memcache with dumber caching and smarter hashing. In NSDI 13, pages 371--384, 2013."},{"key":"key-10.1145\/3216122.3216156-13","doi-asserted-by":"crossref","unstructured":"P. Garcia and H. F. Korth. Database hash-join algorithms on multithreaded computer architectures. In CF '06, pages 241--252. ACM, 2006.","DOI":"10.1145\/1128022.1128055"},{"key":"key-10.1145\/3216122.3216156-14","unstructured":"G. Graefe, R. Bunker, and S. Cooper. Hash joins and hash teams in microsoft sql server. In VLDB, pages 86--97, 1998."},{"key":"key-10.1145\/3216122.3216156-15","doi-asserted-by":"crossref","unstructured":"J. Gray, P. Sundaresan, S. Englert, K. Baclawski, and P. J. Weinberger. Quickly generating billion-record synthetic databases. In Sigmod, pages 243--252. ACM, 1994.","DOI":"10.1145\/191839.191886"},{"key":"key-10.1145\/3216122.3216156-16","unstructured":"H. Guiroux, R. Lachaize, and V. Qu&#233;ma. Multicore locks: The case is not closed yet. In USENIX ATC, pages 649--662, 2016."},{"key":"key-10.1145\/3216122.3216156-17","doi-asserted-by":"crossref","unstructured":"Q. Huang, H. Gudmundsdottir, Y. Vigfusson, D. A. Freedman, K. Birman, and R. van Renesse. Characterizing load imbalance in real-world networked caches. In HotNets, page 8. ACM, 2014.","DOI":"10.1145\/2670518.2673882"},{"key":"key-10.1145\/3216122.3216156-18","unstructured":"T. Kejser. TPC-H Schema and Indexes. http:\/\/kejser.org\/tpc-h-schema-and-indexes\/, Jun 2014 (accessed June 16, 2017)."},{"key":"key-10.1145\/3216122.3216156-19","doi-asserted-by":"crossref","unstructured":"A. Kemper and T. Neumann. Hyper: A hybrid oltp&olap main memory database system based on virtual memory snapshots. In ICDE, pages 195--206, 2011.","DOI":"10.1109\/ICDE.2011.5767867"},{"key":"key-10.1145\/3216122.3216156-20","doi-asserted-by":"crossref","unstructured":"C. Kim, T. Kaldewey, V. W. Lee, E. Sedlar, A. D. Nguyen, N. Satish, J. Chhugani, A. Di Blas, and P. Dubey. Sort vs. hash revisited: fast join implementation on modern multi-core cpus. VLDBJ, pages 1378--1389, 2009.","DOI":"10.14778\/1687553.1687564"},{"key":"key-10.1145\/3216122.3216156-21","doi-asserted-by":"crossref","unstructured":"A. Kirsch, M. Mitzenmacher, and U. Wieder. More robust hashing: Cuckoo hashing with a stash. In ESA, pages 611--622, 2008.","DOI":"10.1007\/978-3-540-87744-8_51"},{"key":"key-10.1145\/3216122.3216156-22","doi-asserted-by":"crossref","unstructured":"S. Kumar, J. Turner, and P. Crowley. Peacock hashing: Deterministic and updatable hashing for high performance networking. In INFOCOM, pages 101--105. IEEE, 2008.","DOI":"10.1109\/INFOCOM.2008.29"},{"key":"key-10.1145\/3216122.3216156-23","doi-asserted-by":"crossref","unstructured":"H. Lang, V. Leis, M. Albutiu, T. Neumann, and A. Kemper. Massively parallel numa-aware hash joins. In IMDM, pages 3--14, 2013.","DOI":"10.1007\/978-3-319-13960-9_1"},{"key":"key-10.1145\/3216122.3216156-24","doi-asserted-by":"crossref","unstructured":"X. Li, D. G. Andersen, M. Kaminsky, and M. J. Freedman. Algorithmic improvements for fast concurrent cuckoo hashing. In EuroSys, pages 27:1--27:14. ACM, 2014.","DOI":"10.1145\/2592798.2592820"},{"key":"key-10.1145\/3216122.3216156-25","doi-asserted-by":"crossref","unstructured":"S. Manegold, P. Boncz, and M. Kersten. Optimizing main-memory join on modern hardware. TKDE, pages 709--730, 2002.","DOI":"10.1109\/TKDE.2002.1019210"},{"key":"key-10.1145\/3216122.3216156-26","doi-asserted-by":"crossref","unstructured":"R. Pagh and F. F. Rodler. Cuckoo hashing. In ESA, pages 121--133. Springer, 2001.","DOI":"10.1007\/3-540-44676-1_10"},{"key":"key-10.1145\/3216122.3216156-27","doi-asserted-by":"crossref","unstructured":"S. Richter, V. Alvarez, and J. Dittrich. A seven-dimensional analysis of hashing methods and its implications on query processing. VLDBJ, pages 96--107, 2015.","DOI":"10.14778\/2850583.2850585"},{"key":"key-10.1145\/3216122.3216156-28","doi-asserted-by":"crossref","unstructured":"A. Shanbhag, H. Pirk, and S. Madden. Locality-adaptive parallel hash joins using hardware transactional memory. In IMDM, 2016.","DOI":"10.1007\/978-3-319-56111-0_7"},{"key":"key-10.1145\/3216122.3216156-29","unstructured":"C. Silverstein. Google sparsehash. https:\/\/github.com\/sparsehash\/sparsehash, 2005."}],"event":{"number":"22","sponsor":["Concordia University"],"acronym":"IDEAS 2018","name":"the 22nd International Database Engineering & Applications Symposium","start":{"date-parts":[[2018,6,18]]},"location":"Villa San Giovanni, Italy","end":{"date-parts":[[2018,6,20]]}},"container-title":["Proceedings of the 22nd International Database Engineering &amp; Applications Symposium on - IDEAS 2018"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3216122.3216156","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3216156&ftid=1986376&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:29:34Z","timestamp":1750285774000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3216122.3216156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1145\/3216122.3216156","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}