{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T03:06:01Z","timestamp":1787022361535,"version":"build-2736575974"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2011,10]]},"abstract":"<jats:p>A new emerging class of parallel database management systems (DBMS) is designed to take advantage of the partitionable workloads of on-line transaction processing (OLTP) applications [23, 20]. Transactions in these systems are optimized to execute to completion on a single node in a shared-nothing cluster without needing to coordinate with other nodes or use expensive concurrency control measures [18]. But some OLTP applications cannot be partitioned such that all of their transactions execute within a single-partition in this manner. These distributed transactions access data not stored within their local partitions and subsequently require more heavy-weight concurrency control protocols. Further difficulties arise when the transaction's execution properties, such as the number of partitions it may need to access or whether it will abort, are not known beforehand. The DBMS could mitigate these performance issues if it is provided with additional information about transactions. Thus, in this paper we present a Markov model-based approach for automatically selecting which optimizations a DBMS could use, namely (1) more efficient concurrency control schemes, (2) intelligent scheduling, (3) reduced undo logging, and (4) speculative execution. To evaluate our techniques, we implemented our models and integrated them into a parallel, main-memory OLTP DBMS to show that we can improve the performance of applications with diverse workloads.<\/jats:p>","DOI":"10.14778\/2078324.2078325","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T08:17:57Z","timestamp":1403597877000},"page":"85-96","source":"Crossref","is-referenced-by-count":48,"title":["On predictive modeling for optimizing transaction execution in parallel OLTP systems"],"prefix":"10.14778","volume":"5","author":[{"given":"Andrew","family":"Pavlo","sequence":"first","affiliation":[{"name":"Brown University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evan P. C.","family":"Jones","sequence":"additional","affiliation":[{"name":"MIT CSAIL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stanley","family":"Zdonik","sequence":"additional","affiliation":[{"name":"Brown University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,10]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"AuctionMark: A Benchmark for High-Performance OLTP Systems. http:\/\/hstore.cs.brown.edu\/projects\/auctionmark. AuctionMark: A Benchmark for High-Performance OLTP Systems. http:\/\/hstore.cs.brown.edu\/projects\/auctionmark."},{"key":"e_1_2_1_2_1","unstructured":"H-Store: A Next Generation OLTP DBMS. http:\/\/hstore.cs.brown.edu. H-Store: A Next Generation OLTP DBMS. http:\/\/hstore.cs.brown.edu."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/1294261.1294278","volume-title":"SOSP","author":"Aguilera M. K.","year":"2007","unstructured":"M. K. Aguilera , A. Merchant , M. Shah , A. Veitch , and C. Karamanolis . Sinfonia: a new paradigm for building scalable distributed systems . In SOSP , pages 159 -- 174 , 2007 . 10.1145\/1294261.1294278 M. K. Aguilera, A. Merchant, M. Shah, A. Veitch, and C. Karamanolis. Sinfonia: a new paradigm for building scalable distributed systems. In SOSP, pages 159--174, 2007. 10.1145\/1294261.1294278"},{"key":"e_1_2_1_4_1","first-page":"706","volume-title":"VLDB","author":"Blott S.","year":"2002","unstructured":"S. Blott and H. F. Korth . An almost-serial protocol for transaction execution in main-memory database systems . In VLDB , pages 706 -- 717 , 2002 . S. Blott and H. F. Korth. An almost-serial protocol for transaction execution in main-memory database systems. In VLDB, pages 706--717, 2002."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/276305.276337"},{"key":"e_1_2_1_6_1","unstructured":"J. Coleman and R. Grosman. Unlimited Scale-up of DB2 Using Server-assisted Client Redirect. http:\/\/ibm.co\/fLR2cH October 2005. J. Coleman and R. Grosman. Unlimited Scale-up of DB2 Using Server-assisted Client Redirect. http:\/\/ibm.co\/fLR2cH October 2005."},{"key":"e_1_2_1_7_1","first-page":"48","article-title":"Schism: a workload-driven approach to database replication and partitioning","volume":"3","author":"Curino C.","year":"2010","unstructured":"C. Curino , E. Jones , Y. Zhang , and S. Madden . Schism: a workload-driven approach to database replication and partitioning . VLDB , 3 : 48 -- 57 , 2010 . C. Curino, E. Jones, Y. Zhang, and S. Madden. Schism: a workload-driven approach to database replication and partitioning. VLDB, 3:48--57, 2010.","journal-title":"VLDB"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/971697.602261"},{"key":"e_1_2_1_9_1","first-page":"1","volume-title":"DBTest '09","author":"Du N.","year":"2009","unstructured":"N. Du , X. Ye , and J. Wang . Towards workflow-driven database system workload modeling . In DBTest '09 , pages 1 -- 6 , 2009 . 10.1145\/1594156.1594169 N. Du, X. Ye, and J. Wang. Towards workflow-driven database system workload modeling. In DBTest '09, pages 1--6, 2009. 10.1145\/1594156.1594169"},{"key":"e_1_2_1_10_1","volume-title":"CASCON, page 2","author":"Elnaffar S. S.","year":"2002","unstructured":"S. S. Elnaffar . A methodology for auto-recognizing dbms workloads . In CASCON, page 2 . IBM Press , 2002 . S. S. Elnaffar. A methodology for auto-recognizing dbms workloads. In CASCON, page 2. IBM Press, 2002."},{"key":"e_1_2_1_11_1","first-page":"13","volume-title":"ICAC","author":"Gupta C.","year":"2008","unstructured":"C. Gupta , A. Mehta , and U. Dayal . PQR: Predicting Query Execution Times for Autonomous Workload Management . In ICAC , pages 13 -- 22 , 2008 . 10.1109\/ICAC.2008.12 C. Gupta, A. Mehta, and U. Dayal. PQR: Predicting Query Execution Times for Autonomous Workload Management. In ICAC, pages 13--22, 2008. 10.1109\/ICAC.2008.12"},{"key":"e_1_2_1_12_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-35488-8","volume-title":"Feature Extraction: Foundations and Applications","author":"Guyon I.","year":"2006","unstructured":"I. Guyon , S. Gunn , M. Nikravesh , and L. A. Zadeh . Feature Extraction: Foundations and Applications . Springer-Verlag , 2006 . I. Guyon, S. Gunn, M. Nikravesh, and L. A. Zadeh. Feature Extraction: Foundations and Applications. Springer-Verlag, 2006."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1656274.1656278"},{"key":"e_1_2_1_14_1","first-page":"981","volume-title":"SIGMOD","author":"Harizopoulos S.","year":"2008","unstructured":"S. Harizopoulos , D. J. Abadi , S. Madden , and M. Stonebraker . OLTP through the looking glass, and what we found there . In SIGMOD , pages 981 -- 992 , 2008 . 10.1145\/1376616.1376713 S. Harizopoulos, D. J. Abadi, S. Madden, and M. Stonebraker. OLTP through the looking glass, and what we found there. In SIGMOD, pages 981--992, 2008. 10.1145\/1376616.1376713"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/1316874.1316892","volume-title":"PIKM","author":"Holze M.","year":"2007","unstructured":"M. Holze and N. Ritter . Towards workload shift detection and prediction for autonomic databases . In PIKM , pages 109 -- 116 , 2007 . 10.1145\/1316874.1316892 M. Holze and N. Ritter. Towards workload shift detection and prediction for autonomic databases. In PIKM, pages 109--116, 2007. 10.1145\/1316874.1316892"},{"key":"e_1_2_1_16_1","first-page":"127","volume-title":"ADBIS","author":"Holze M.","year":"2008","unstructured":"M. Holze and N. Ritter . Autonomic Databases: Detection of Workload Shifts with n-Gram-Models . In ADBIS , pages 127 -- 142 , 2008 . 10.1007\/978-3-540-85713-6_10 M. Holze and N. Ritter. Autonomic Databases: Detection of Workload Shifts with n-Gram-Models. In ADBIS, pages 127--142, 2008. 10.1007\/978-3-540-85713-6_10"},{"key":"e_1_2_1_17_1","volume-title":"Dynamic Programming and Markov Processes","author":"Howard R. A.","year":"1960","unstructured":"R. A. Howard . Dynamic Programming and Markov Processes . MITPress , 1960 . R. A. Howard. Dynamic Programming and Markov Processes. MITPress, 1960."},{"key":"e_1_2_1_18_1","first-page":"603","volume-title":"SIGMOD","author":"Jones E. P.","year":"2010","unstructured":"E. P. Jones , D. J. Abadi , and S. Madden . Low overhead concurrency control for partitioned main memory databases . In SIGMOD , pages 603 -- 614 , 2010 . 10.1145\/1807167.1807233 E. P. Jones, D. J. Abadi, and S. Madden. Low overhead concurrency control for partitioned main memory databases. In SIGMOD, pages 603--614, 2010. 10.1145\/1807167.1807233"},{"key":"e_1_2_1_19_1","first-page":"751","volume-title":"ECAI","author":"Kadioglu S.","year":"2010","unstructured":"S. Kadioglu , Y. Malitsky , M. Sellmann , and K. Tierney . Isac -- instance-specific algorithm configuration . In ECAI , pages 751 -- 756 , 2010 . S. Kadioglu, Y. Malitsky, M. Sellmann, and K. Tierney. Isac -- instance-specific algorithm configuration. In ECAI, pages 751--756, 2010."},{"issue":"2","key":"e_1_2_1_20_1","first-page":"1496","article-title":"H-Store: A High-Performance","volume":"1","author":"Kallman R.","year":"2008","unstructured":"R. Kallman , H. Kimura , J. Natkins , A. Pavlo , A. Rasin , S. Zdonik , E. P. C. Jones , S. Madden , M. Stonebraker , Y. Zhang , J. Hugg , and D. J. Abadi . H-Store: A High-Performance , Distributed Main Memory Transaction Processing System. Proc. VLDB Endow. , 1 ( 2 ): 1496 -- 1499 , 2008 . R. Kallman, H. Kimura, J. Natkins, A. Pavlo, A. Rasin, S. Zdonik, E. P. C. Jones, S. Madden, M. Stonebraker, Y. Zhang, J. Hugg, and D. J. Abadi. H-Store: A High-Performance, Distributed Main Memory Transaction Processing System. Proc. VLDB Endow., 1(2):1496--1499, 2008.","journal-title":"Distributed Main Memory Transaction Processing System. Proc. VLDB Endow."},{"key":"e_1_2_1_21_1","first-page":"520","volume-title":"ICDE","author":"Samaras G.","year":"1993","unstructured":"G. Samaras , K. Britton , A. Citron , and C. Mohan . Two-phase commit optimizations and tradeoffs in the commercial environment . In ICDE , pages 520 -- 529 , 1993 . G. Samaras, K. Britton, A. Citron, and C. Mohan. Two-phase commit optimizations and tradeoffs in the commercial environment. In ICDE, pages 520--529, 1993."},{"key":"e_1_2_1_22_1","first-page":"224","volume-title":"DaWaK","author":"Sapia C.","year":"2000","unstructured":"C. Sapia . PROMISE : Predicting Query Behavior to Enable Predictive Caching Strategies for OLAP Systems . In DaWaK , pages 224 -- 233 , 2000 . C. Sapia. PROMISE: Predicting Query Behavior to Enable Predictive Caching Strategies for OLAP Systems. In DaWaK, pages 224--233, 2000."},{"key":"e_1_2_1_23_1","first-page":"1150","volume-title":"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 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 VLDB, pages 1150--1160, 2007."},{"key":"e_1_2_1_24_1","volume-title":"http:\/\/www.tpc.org\/tpcc\/spec\/tpcc_current.pdf","author":"Transaction Processing Council","year":"2008","unstructured":"Transaction Processing Council . TPC-C Benchmark (Version 5.10). http:\/\/www.tpc.org\/tpcc\/spec\/tpcc_current.pdf , 2008 . Transaction Processing Council. TPC-C Benchmark (Version 5.10). http:\/\/www.tpc.org\/tpcc\/spec\/tpcc_current.pdf, 2008."},{"key":"e_1_2_1_25_1","volume-title":"March","author":"Wolski A.","year":"2009","unstructured":"A. Wolski . TATP Benchmark Description (Version 1.0). http:\/\/tatpbenchmark.sourceforge.net , March 2009 . A. Wolski. TATP Benchmark Description (Version 1.0). http:\/\/tatpbenchmark.sourceforge.net, March 2009."},{"key":"e_1_2_1_26_1","first-page":"565","article-title":"Satzilla: portfolio-based algorithm selection for sat","volume":"32","author":"Xu L.","year":"2008","unstructured":"L. Xu , F. Hutter , H. H. Hoos , and K. Leyton-Brown . Satzilla: portfolio-based algorithm selection for sat . J. Artif. Int. Res. , 32 : 565 -- 606 , June 2008 . L. Xu, F. Hutter, H. H. Hoos, and K. Leyton-Brown. Satzilla: portfolio-based algorithm selection for sat. J. Artif. Int. Res., 32:565--606, June 2008.","journal-title":"J. Artif. Int. Res."},{"key":"e_1_2_1_27_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/11875604_56","volume-title":"Foundations of Intelligent Systems","author":"Yao Q.","year":"2006","unstructured":"Q. Yao , A. An , and X. Huang . Mining and modeling database user access patterns . In Foundations of Intelligent Systems , volume 4203 of Lecture Notes in Computer Science , pages 493 -- 503 . 2006 . 10.1007\/11875604_56 Q. Yao, A. An, and X. Huang. Mining and modeling database user access patterns. In Foundations of Intelligent Systems, volume 4203 of Lecture Notes in Computer Science, pages 493--503. 2006. 10.1007\/11875604_56"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.129222"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2078324.2078325","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,14]],"date-time":"2023-07-14T10:42:13Z","timestamp":1689331333000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2078324.2078325"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,10]]}},"alternative-id":["10.14778\/2078324.2078325"],"URL":"https:\/\/doi.org\/10.14778\/2078324.2078325","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}