{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T07:36:20Z","timestamp":1767857780381,"version":"3.49.0"},"reference-count":21,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p>In analytical applications, database systems often need to sustain workloads with multiple concurrent scans hitting the same table. The Cooperative Scans (CScans) framework, which introduces an Active Buffer Manager (ABM) component into the database architecture, has been the most effective and elaborate response to this problem, and was initially developed in the X100 research prototype. We now report on the the experiences of integrating Cooperative Scans into its industrial-strength successor, the Vectorwise database product. During this implementation we invented a simpler optimization of concurrent scan buffer management, called Predictive Buffer Management (PBM). PBM is based on the observation that in a workload with long-running scans, the buffer manager has quite a bit of information on the workload in the immediate future, such that an approximation of the ideal OPT algorithm becomes feasible. In the evaluation on both synthetic benchmarks as well as a TPC-H throughput run we compare the benefits of naive buffer management (LRU) versus CScans, PBM and OPT; showing that PBM achieves benefits close to Cooperative Scans, while incurring much lower architectural impact.<\/jats:p>","DOI":"10.14778\/2367502.2367515","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1759-1770","source":"Crossref","is-referenced-by-count":4,"title":["From cooperative scans to predictive buffer management"],"prefix":"10.14778","volume":"5","author":[{"given":"Micha\u0142","family":"\u015awitakowski","sequence":"first","affiliation":[{"name":"Actian Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Boncz","sequence":"additional","affiliation":[{"name":"CWI Amsterdam"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Zukowski","sequence":"additional","affiliation":[{"name":"Actian Corporation"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2012,8]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.52.0078"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223785"},{"key":"e_1_2_1_3_1","first-page":"342","volume-title":"VLDB","author":"Chen C.-M.","year":"1993","unstructured":"C.-M. Chen and N. Roussopoulos . Adaptive database buffer allocation using query feedback . In VLDB , pages 342 -- 353 , 1993 . C.-M. Chen and N. Roussopoulos. Adaptive database buffer allocation using query feedback. In VLDB, pages 342--353, 1993."},{"key":"e_1_2_1_4_1","first-page":"127","volume-title":"VLDB","author":"Chou H.-T.","year":"1985","unstructured":"H.-T. Chou and D. J. DeWitt . An evaluation of buffer management strategies for relational database systems . In VLDB , pages 127 -- 141 , 1985 . H.-T. Chou and D. J. DeWitt. An evaluation of buffer management strategies for relational database systems. In VLDB, pages 127--141, 1985."},{"key":"e_1_2_1_5_1","volume-title":"Database Architecture: The Storage Engine","author":"Cook C.","year":"2001","unstructured":"C. Cook . Database Architecture: The Storage Engine , 2001 . http:\/\/msdn.microsoft.com\/library. C. Cook. Database Architecture: The Storage Engine, 2001. http:\/\/msdn.microsoft.com\/library."},{"key":"e_1_2_1_6_1","first-page":"265","volume-title":"VLDB","author":"Faloutsos C.","year":"1991","unstructured":"C. Faloutsos , R. T. Ng , and T. K. Sellis . Predictive load control for flexible buffer allocation . In VLDB , pages 265 -- 274 , 1991 . C. Faloutsos, R. T. Ng, and T. K. Sellis. Predictive load control for flexible buffer allocation. In VLDB, pages 265--274, 1991."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/191843.191947"},{"key":"e_1_2_1_8_1","first-page":"1227","volume-title":"SIGMOD","author":"Giannikis G.","year":"2010","unstructured":"G. Giannikis , P. Unterbrunner , J. Meyer , G. Alonso , D. Fauser , and D. Kossmann . Crescando . In SIGMOD , pages 1227 -- 1230 , 2010 . 10.1145\/1807167.1807326 G. Giannikis, P. Unterbrunner, J. Meyer, G. Alonso, D. Fauser, and D. Kossmann. Crescando. In SIGMOD, pages 1227--1230, 2010. 10.1145\/1807167.1807326"},{"key":"e_1_2_1_9_1","first-page":"102","volume-title":"SIGMOD","author":"Graefe G.","year":"1990","unstructured":"G. Graefe . Encapsulation of parallelism in the volcano query processing system . In SIGMOD , pages 102 -- 111 , 1990 . 10.1145\/93605.98720 G. Graefe. Encapsulation of parallelism in the volcano query processing system. In SIGMOD, pages 102--111, 1990. 10.1145\/93605.98720"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1145\/1066157.1066201","volume-title":"SIGMOD","author":"Harizopoulos S.","year":"2005","unstructured":"S. Harizopoulos , V. Shkapenyuk , and A. Ailamaki . Qpipe: a simultaneously pipelined relational query engine . In SIGMOD , pages 383 -- 394 , 2005 . 10.1145\/1066157.1066201 S. Harizopoulos, V. Shkapenyuk, and A. Ailamaki. Qpipe: a simultaneously pipelined relational query engine. In SIGMOD, pages 383--394, 2005. 10.1145\/1066157.1066201"},{"key":"e_1_2_1_11_1","first-page":"543","volume-title":"SIGMOD","author":"H\u00e9man S.","year":"2010","unstructured":"S. H\u00e9man , M. Zukowski , N. J. Nes , L. Sidirourgos , and P. Boncz . Positional update handling in column stores . In SIGMOD , pages 543 -- 554 , 2010 . 10.1145\/1807167.1807227 S. H\u00e9man, M. Zukowski, N. J. Nes, L. Sidirourgos, and P. Boncz. Positional update handling in column stores. In SIGMOD, pages 543--554, 2010. 10.1145\/1807167.1807227"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070736.2070747"},{"key":"e_1_2_1_13_1","first-page":"1136","volume-title":"ICDE","author":"Lang C. A.","year":"2007","unstructured":"C. A. Lang , B. Bhattacharjee , T. Malkemus , S. Padmanabhan , and K. Wong . Increasing buffer-locality for multiple relational table scans through grouping and throttling . In ICDE , pages 1136 -- 1145 , 2007 . C. A. Lang, B. Bhattacharjee, T. Malkemus, S. Padmanabhan, and K. Wong. Increasing buffer-locality for multiple relational table scans through grouping and throttling. In ICDE, pages 1136--1145, 2007."},{"key":"e_1_2_1_14_1","first-page":"1298","volume-title":"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 VLDB , pages 1298 -- 1309 , 2007 . 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 VLDB, pages 1298--1309, 2007."},{"key":"e_1_2_1_15_1","volume-title":"A short proof of optimality for the min cache replacement algorithm. Technical report","author":"Roy B. V.","year":"2010","unstructured":"B. V. Roy . A short proof of optimality for the min cache replacement algorithm. Technical report , Stanford University , 2010 . B. V. Roy. A short proof of optimality for the min cache replacement algorithm. Technical report, Stanford University, 2010."},{"key":"e_1_2_1_16_1","first-page":"78","volume-title":"SOSP","author":"Teorey T. J.","year":"1971","unstructured":"T. J. Teorey and T. B. Pinkerton . A comparative analysis of disk scheduling policies . In SOSP , pages 78 -- 87 , 1971 . 10.1145\/800212.806509 T. J. Teorey and T. B. Pinkerton. A comparative analysis of disk scheduling policies. In SOSP, pages 78--87, 1971. 10.1145\/800212.806509"},{"issue":"1","key":"e_1_2_1_17_1","first-page":"706","article-title":"Predictable performance for unpredictable workloads","volume":"2","author":"Unterbrunner P.","year":"2009","unstructured":"P. Unterbrunner , G. Giannikis , G. Alonso , D. Fauser , and D. Kossmann . Predictable performance for unpredictable workloads . PVLDB , 2 ( 1 ): 706 -- 717 , 2009 . P. Unterbrunner, G. Giannikis, G. Alonso, D. Fauser, and D. Kossmann. Predictable performance for unpredictable workloads. PVLDB, 2(1):706--717, 2009.","journal-title":"PVLDB"},{"key":"e_1_2_1_18_1","unstructured":"Vectorwise. http:\/\/www.actian.com\/vectorwise. Vectorwise. http:\/\/www.actian.com\/vectorwise."},{"issue":"1","key":"e_1_2_1_19_1","first-page":"21","article-title":"Vectorwise","volume":"35","author":"Zukowski M.","year":"2012","unstructured":"M. Zukowski and P. Boncz . Vectorwise : Beyond Column Stores. IEEE DEBULL , 35 ( 1 ): 21 -- 27 , 2012 . M. Zukowski and P. Boncz. Vectorwise: Beyond Column Stores. IEEE DEBULL, 35(1):21--27, 2012.","journal-title":"Beyond Column Stores. IEEE DEBULL"},{"issue":"2","key":"e_1_2_1_20_1","first-page":"17","article-title":"Monetdb\/X100 - A DBMS","volume":"28","author":"Zukowski M.","year":"2005","unstructured":"M. Zukowski , P. A. Boncz , N. J. Nes , and S. Heman . Monetdb\/X100 - A DBMS In The CPU Cache. IEEE DEBULL , 28 ( 2 ): 17 -- 22 , 2005 . M. Zukowski, P. A. Boncz, N. J. Nes, and S. Heman. Monetdb\/X100 - A DBMS In The CPU Cache. IEEE DEBULL, 28(2):17--22, 2005.","journal-title":"The CPU Cache. IEEE DEBULL"},{"key":"e_1_2_1_21_1","first-page":"723","volume-title":"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 VLDB , pages 723 -- 734 , 2007 . M. Zukowski, S. H\u00e9man, N. Nes, and P. Boncz. Cooperative scans: dynamic bandwidth sharing in a dbms. In 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\/2367502.2367515","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T14:43:08Z","timestamp":1689345788000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2367502.2367515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":21,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.14778\/2367502.2367515"],"URL":"https:\/\/doi.org\/10.14778\/2367502.2367515","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}