{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:54:56Z","timestamp":1777564496931,"version":"3.51.4"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>Database architectures typically process queries one-at-a-time, executing concurrent queries in independent execution contexts. Often, such a design leads to unpredictable performance and poor scalability. One approach to circumvent the problem is to take advantage of sharing opportunities across concurrently running queries. In this paper we propose Many-Query Join (MQJoin), a novel method for sharing the execution of a join that can efficiently deal with hundreds of concurrent queries. This is achieved by minimizing redundant work and making efficient use of main-memory bandwidth and multi-core architectures. Compared to existing proposals, MQJoin is able to efficiently handle larger workloads regardless of the schema by exploiting more sharing opportunities. We also compared MQJoin to two commercial main-memory column-store databases. For a TPC-H based workload, we show that MQJoin provides 2--5x higher throughput with significantly more stable response times.<\/jats:p>","DOI":"10.14778\/2904121.2904124","type":"journal-article","created":{"date-parts":[[2016,4,12]],"date-time":"2016-04-12T12:24:41Z","timestamp":1460463881000},"page":"480-491","source":"Crossref","is-referenced-by-count":23,"title":["MQJoin"],"prefix":"10.14778","volume":"9","author":[{"given":"Darko","family":"Makreshanski","sequence":"first","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georgios","family":"Giannikis","sequence":"additional","affiliation":[{"name":"Oracle Labs"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo","family":"Alonso","sequence":"additional","affiliation":[{"name":"ETH Zurich"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Kossmann","sequence":"additional","affiliation":[{"name":"ETH Zurich and Microsoft Research"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,1]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"TPC-H Benchmark. http:\/\/www.tpc.org\/tpch\/spec\/tpch2.17.0.pdf.  TPC-H Benchmark. http:\/\/www.tpc.org\/tpch\/spec\/tpch2.17.0.pdf."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2336664.2336678"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807224"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335420"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732227"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544839"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989328"},{"key":"e_1_2_1_8_1","first-page":"225","volume-title":"Proc. CIDR 2005","author":"Boncz P. A.","year":"2005","unstructured":"P. A. Boncz , M. Zukowski , and N. Nes . MonetDB\/X100: Hyper-Pipelining Query Execution . In Proc. CIDR 2005 , pages 225 -- 237 , 2005 . P. A. Boncz, M. Zukowski, and N. Nes. MonetDB\/X100: Hyper-Pipelining Query Execution. In Proc. CIDR 2005, pages 225--237, 2005."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687659"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/977401.978128"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272743.1272747"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168654"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732279.2732280"},{"key":"e_1_2_1_14_1","first-page":"11","volume-title":"In IEEE Data","author":"Harizopoulos S.","year":"2005","unstructured":"S. Harizopoulos and A. Ailamaki . StagedDB: Designing Database Servers for Modern Hardware . In In IEEE Data , pages 11 -- 16 , 2005 . S. Harizopoulos and A. Ailamaki. StagedDB: Designing Database Servers for Modern Hardware. In In IEEE Data, pages 11--16, 2005."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066201"},{"key":"e_1_2_1_16_1","first-page":"351","volume-title":"Proc. VLDB 2007","author":"Johnson R.","year":"2007","unstructured":"R. Johnson , S. Harizopoulos , N. Hardavellas , K. Sabirli , I. Pandis , A. Ailamaki , N. G. Mancheril , and B. Falsafi . To Share or Not to Share ? In Proc. VLDB 2007 , pages 351 -- 362 , 2007 . R. Johnson, S. Harizopoulos, N. Hardavellas, K. Sabirli, I. Pandis, A. Ailamaki, N. G. Mancheril, and B. Falsafi. To Share or Not to Share? In Proc. VLDB 2007, pages 351--362, 2007."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687553.1687564"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368972"},{"key":"e_1_2_1_19_1","first-page":"1298","volume-title":"Proc. VLDB","author":"Lang C. A.","year":"2007","unstructured":"C. A. Lang , B. Bhattacharjee , T. Malkemus , and K. Wong . Increasing Buffer-locality for Multiple Index Based Scans through Intelligent Placement and Index Scan Speed Control . In Proc. VLDB 2007 , pages 1298 -- 1309 . C. A. Lang, B. Bhattacharjee, T. Malkemus, and K. Wong. Increasing Buffer-locality for Multiple Index Based Scans through Intelligent Placement and Index Scan Speed Control. In Proc. VLDB 2007, pages 1298--1309."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2002.1019210"},{"key":"e_1_2_1_21_1","unstructured":"P. O'Neil B. O'Neal and X. Chen. Star Schema Benchmark. http:\/\/www.cs.umb.edu\/~poneil\/StarSchemaB.PDF.  P. O'Neil B. O'Neal and X. Chen. Star Schema Benchmark. http:\/\/www.cs.umb.edu\/~poneil\/StarSchemaB.PDF."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536360.2536364"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453924"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497414"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"e_1_2_1_26_1","first-page":"510","volume-title":"Proc. VLDB 1994","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 , pages 510 -- 521 , 1994 . A. Shatdal, C. Kant, and J. F. Naughton. Cache Conscious Algorithms for Relational Query Processing. In Proc. VLDB 1994, pages 510--521, 1994."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687707"},{"key":"e_1_2_1_28_1","first-page":"723","volume-title":"Proc. VLDB 2007","author":"Zukowski M.","year":"2007","unstructured":"M. Zukowski , S. H\u00e9man , N. Nes , and P. Boncz . Cooperative Scans: Dynamic Bandwidth Sharing in a DBMS . In Proc. VLDB 2007 , pages 723 -- 734 , 2007 . M. Zukowski, S. H\u00e9man, N. Nes, and P. Boncz. Cooperative Scans: Dynamic Bandwidth Sharing in a DBMS. In Proc. VLDB 2007, pages 723--734, 2007."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1457150.1457160"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.148"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2904121.2904124","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:54:33Z","timestamp":1672224873000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2904121.2904124"}},"subtitle":["efficient shared execution of main-memory joins"],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":30,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.14778\/2904121.2904124"],"URL":"https:\/\/doi.org\/10.14778\/2904121.2904124","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}