{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T07:12:59Z","timestamp":1779174779164,"version":"3.51.4"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"6","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,2]]},"abstract":"<jats:p>Traditional database systems are built around the query-at-a-time model. This approach tries to optimize performance in a best-effort way. Unfortunately, best effort is not good enough for many modern applications. These applications require response time guarantees in high load situations. This paper describes the design of a new database architecture that is based on batching queries and shared computation across possibly hundreds of concurrent queries and updates. Performance experiments with the TPC-W benchmark show that the performance of our implementation, SharedDB, is indeed robust across a wide range of dynamic workloads.<\/jats:p>","DOI":"10.14778\/2168651.2168654","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"526-537","source":"Crossref","is-referenced-by-count":90,"title":["SharedDB"],"prefix":"10.14778","volume":"5","author":[{"given":"Georgios","family":"Giannikis","sequence":"first","affiliation":[{"name":"Systems Group, ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gustavo","family":"Alonso","sequence":"additional","affiliation":[{"name":"Systems Group, ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Donald","family":"Kossmann","sequence":"additional","affiliation":[{"name":"Systems Group, ETH Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807224"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335420"},{"key":"e_1_2_1_3_1","first-page":"277","volume-title":"Predictable Join Operator for Highly Concurrent Data Warehouses. In Proc. VLDB","author":"Candea G.","year":"2009","unstructured":"G. Candea , N. Polyzotis , and R. Vingralek . A Scalable , Predictable Join Operator for Highly Concurrent Data Warehouses. In Proc. VLDB , pages 277 -- 288 , 2009 . G. Candea, N. Polyzotis, and R. Vingralek. A Scalable, Predictable Join Operator for Highly Concurrent Data Warehouses. In Proc. VLDB, pages 277--288, 2009."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0221-2"},{"key":"e_1_2_1_5_1","first-page":"146","volume-title":"Proc. VLDB","author":"Chaudhuri S.","year":"1997","unstructured":"S. Chaudhuri and V. R. Narasayya . An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server . In Proc. VLDB , pages 146 -- 155 , 1997 . S. Chaudhuri and V. R. Narasayya. An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server. In Proc. VLDB, pages 146--155, 1997."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375561"},{"key":"e_1_2_1_7_1","first-page":"330","volume-title":"Proc. VLDB","author":"Dar S.","year":"1996","unstructured":"S. Dar , M. J. Franklin , B. T. J\u00f3nsson , D. Srivastava , and M. Tan . Semantic Data Caching and Replacement . In Proc. VLDB , pages 330 -- 341 , 1996 . S. Dar, M. J. Franklin, B. T. J\u00f3nsson, D. Srivastava, and M. Tan. Semantic Data Caching and Replacement. In Proc. VLDB, pages 330--341, 1996."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/958942.958947"},{"key":"e_1_2_1_9_1","first-page":"299","volume-title":"Proc. VLDB","author":"Dittrich J.-P.","year":"2002","unstructured":"J.-P. Dittrich , B. Seeger , D. S. Taylor , and P. Widmayer . Progressive Merge Join: a Generic and Non-Blocking Sort-Based Join Algorithm . In Proc. VLDB , pages 299 -- 310 , 2002 . J.-P. Dittrich, B. Seeger, D. S. Taylor, and P. Widmayer. Progressive Merge Join: a Generic and Non-Blocking Sort-Based Join Algorithm. In Proc. VLDB, pages 299--310, 2002."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/191839.191947"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/582353.582400"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.25"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/67544.66962"},{"issue":"2","key":"e_1_2_1_14_1","first-page":"11","volume":"28","author":"Harizopoulos S.","year":"2005","unstructured":"S. Harizopoulos and A. Ailamaki . StagedDB : Designing Database Servers for Modern Hardware. IEEE Data Eng. Bull. , 28 ( 2 ): 11 -- 16 , 2005 . S. Harizopoulos and A. Ailamaki. StagedDB: Designing Database Servers for Modern Hardware. IEEE Data Eng. Bull., 28(2):11--16, 2005.","journal-title":"Designing Database Servers for Modern Hardware. IEEE Data Eng. Bull."},{"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":"386","volume-title":"Proc. VLDB","author":"Helmer S.","year":"1997","unstructured":"S. Helmer and G. Moerkotte . Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates . In Proc. VLDB , pages 386 -- 395 , 1997 . S. Helmer and G. Moerkotte. Evaluation of Main Memory Join Algorithms for Joins with Set Comparison Join Predicates. In Proc. VLDB, pages 386--395, 1997."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1363189.1363195"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559879"},{"key":"e_1_2_1_19_1","first-page":"1378","volume-title":"Hash Revisited: Fast Join Implementation on Modern Multi-Core CPUs. In Proc. VLDB","author":"Kim C.","year":"2009","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. In Proc. VLDB , pages 1378 -- 1389 , 2009 . 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. In Proc. VLDB, pages 1378--1389, 2009."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/377674.377677"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453924"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497414"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966448"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/582095.582099"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/42201.42203"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/6314.6315"},{"key":"e_1_2_1_27_1","first-page":"1150","volume-title":"Proc. VLDB","author":"Stonebraker M.","year":"2007","unstructured":"M. Stonebraker , S. Madden , D. J. Abadi , S. Harizopoulos , N. Hachem , and P. Helland . The End of an Architectural Era: (It's Time for a Complete Rewrite) . In Proc. VLDB , pages 1150 -- 1160 , 2007 . M. Stonebraker, S. Madden, D. J. Abadi, S. Harizopoulos, N. Hachem, and P. Helland. The End of an Architectural Era: (It's Time for a Complete Rewrite). In Proc. VLDB, pages 1150--1160, 2007."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687707"},{"key":"e_1_2_1_29_1","first-page":"723","volume-title":"Proc VLDB","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 , 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, pages 723--734, 2007."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2168651.2168654","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:17:41Z","timestamp":1672219061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2168651.2168654"}},"subtitle":["killing one thousand queries with one stone"],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["10.14778\/2168651.2168654"],"URL":"https:\/\/doi.org\/10.14778\/2168651.2168654","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,2]]}}}