{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T16:59:40Z","timestamp":1758905980916},"reference-count":56,"publisher":"Association for Computing Machinery (ACM)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,6]]},"abstract":"<jats:p>Distributed transactions suffer from poor performance due to two major limiting factors. First, distributed transactions suffer from high latency because each of their accesses to remote data incurs a long network delay. Second, this high latency increases the likelihood of contention among distributed transactions, leading to high abort rates and low performance.<\/jats:p>\n          <jats:p>\n            We present\n            <jats:bold>Sundial<\/jats:bold>\n            , an in-memory distributed optimistic concurrency control protocol that addresses these two limitations. First, to reduce the transaction abort rate, Sundial dynamically determines the logical order among transactions at runtime, based on their data access patterns. Sundial achieves this by applying\n            <jats:italic>logical leases<\/jats:italic>\n            to each data element, which allows the database to dynamically calculate a transaction's logical commit timestamp. Second, to reduce the overhead of remote data accesses, Sundial allows the database to cache remote data in a server's local main memory and maintains cache coherence. With logical leases, Sundial integrates concurrency control and cache coherence into a simple unified protocol. We evaluate Sundial against state-of-the-art distributed concurrency control protocols. Sundial outperforms the next-best protocol by up to 57% under high contention. Sundial's caching scheme improves performance by up to 4.6\u00d7 in workloads with high access skew.\n          <\/jats:p>","DOI":"10.14778\/3231751.3231763","type":"journal-article","created":{"date-parts":[[2018,7,27]],"date-time":"2018-07-27T12:21:07Z","timestamp":1532694067000},"page":"1289-1302","source":"Crossref","is-referenced-by-count":31,"title":["Sundial"],"prefix":"10.14778","volume":"11","author":[{"given":"Xiangyao","family":"Yu","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Yu","family":"Xia","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Andrew","family":"Pavlo","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University"}]},{"given":"Daniel","family":"Sanchez","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Larry","family":"Rudolph","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology and Two Sigma Investments, LP"}]},{"given":"Srinivas","family":"Devadas","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]}],"member":"320","published-online":{"date-parts":[[2018,6]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"CockroachDB. https:\/\/www.cockroachlabs.com.  CockroachDB. https:\/\/www.cockroachlabs.com."},{"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","unstructured":"VoltDB. http:\/\/voltdb.com.  VoltDB. http:\/\/voltdb.com."},{"key":"e_1_2_1_4_1","first-page":"1","volume-title":"Sensors for Industry Conference","author":"IEEE","year":"2008","unstructured":"IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems . In Sensors for Industry Conference ( 2008 ), pp. 1 -- 300 . IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems. In Sensors for Industry Conference (2008), pp. 1--300."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223787"},{"key":"e_1_2_1_6_1","volume-title":"Hypertransport System Architecture","author":"Anderson D.","year":"2003","unstructured":"Anderson , D. , and Trodden , J . Hypertransport System Architecture . Addison-Wesley Professional , 2003 . Anderson, D., and Trodden, J. Hypertransport System Architecture. Addison-Wesley Professional, 2003."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/6513.6514"},{"key":"e_1_2_1_8_1","first-page":"9","author":"Bayer R.","year":"1982","unstructured":"Bayer , R. , Elhardt , K. , Heigert , J. , and Reiser , A . Dynamic Timestamp Allocation for Transactions in Database Systems. In DDB ( 1982 ), pp. 9 -- 20 . Bayer, R., Elhardt, K., Heigert, J., and Reiser, A. Dynamic Timestamp Allocation for Transactions in Database Systems. In DDB (1982), pp. 9--20.","journal-title":"Dynamic Timestamp Allocation for Transactions in Database Systems. In DDB ("},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/356842.356846"},{"key":"e_1_2_1_10_1","first-page":"9","volume-title":"Hyder-A Transactional Record Manager for Shared Flash. In CIDR","author":"Bernstein P. A.","year":"2011","unstructured":"Bernstein , P. A. , Reid , C. W. , and Das , S . Hyder-A Transactional Record Manager for Shared Flash. In CIDR ( 2011 ), pp. 9 -- 20 . Bernstein, P. A., Reid, C. W., and Das, S. Hyder-A Transactional Record Manager for Shared Flash. In CIDR (2011), pp. 9--20."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234182"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1987.233178"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260883"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_15_1","first-page":"251","volume-title":"OSDI","author":"Corbett J. C.","year":"2012","unstructured":"Corbett , J. C. , and et al. Spanner: Google's Globally-Distributed Database . In OSDI ( 2012 ), pp. 251 -- 264 . Corbett, J. C., and et al. Spanner: Google's Globally-Distributed Database. In OSDI (2012), pp. 251--264."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807157"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1542476.1542494"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815425"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/360363.360369"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809981"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/261124.261125"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/74850.74870"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055548"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1147\/sj.362.0327"},{"key":"e_1_2_1_27_1","first-page":"23","volume-title":"Treadmarks: Distributed Shared Memory on Standard Workstations and Operating Systems. In USENIX","author":"Keleher P.","year":"1994","unstructured":"Keleher , P. , Cox , A. L. , Dwarkadas , S. , and Zwaenepoel , W . Treadmarks: Distributed Shared Memory on Standard Workstations and Operating Systems. In USENIX ( 1994 ), pp. 23 -- 36 . Keleher, P., Cox, A. L., Dwarkadas, S., and Zwaenepoel, W. Treadmarks: Distributed Shared Memory on Standard Workstations and Operating Systems. In USENIX (1994), pp. 23--36."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882905"},{"key":"e_1_2_1_29_1","first-page":"174","volume-title":"Real-Time Optimistic Concurrency Control Protocol with Dynamic Adjustment of Serialization Order. In RTAS","author":"Lam K.-W.","year":"1995","unstructured":"Lam , K.-W. , Lam , K.-Y. , and Hung , S . -L . Real-Time Optimistic Concurrency Control Protocol with Dynamic Adjustment of Serialization Order. In RTAS ( 1995 ), pp. 174 -- 179 . Lam, K.-W., Lam, K.-Y., and Hung, S.-L. Real-Time Optimistic Concurrency Control Protocol with Dynamic Adjustment of Serialization Order. In RTAS (1995), pp. 174--179."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA466196"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/75104.75105"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064015"},{"key":"e_1_2_1_33_1","volume-title":"How the Rdb\/VMS Data Sharing System Became Fast. Tech. rep","author":"Lomet D.","year":"1992","unstructured":"Lomet , D. , Anderson , R. , Rengarajan , T. K. , and Spiro , P . How the Rdb\/VMS Data Sharing System Became Fast. Tech. rep ., 1992 . Lomet, D., Anderson, R., Rengarajan, T. K., and Spiro, P. How the Rdb\/VMS Data Sharing System Became Fast. Tech. rep., 1992."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.10"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732270"},{"key":"e_1_2_1_36_1","first-page":"479","volume-title":"OSDI","author":"Mu S.","year":"2014","unstructured":"Mu , S. , Cui , Y. , Zhang , Y. , Lloyd , W. , and Li , J . Extracting More Concurrency from Distributed Transactions . In OSDI ( 2014 ), pp. 479 -- 494 . Mu, S., Cui, Y., Zhang, Y., Lloyd, W., and Li, J. Extracting More Concurrency from Distributed Transactions. In OSDI (2014), pp. 479--494."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2749436"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213844"},{"key":"e_1_2_1_39_1","first-page":"279","volume-title":"OSDI","author":"Ports D. R.","year":"2010","unstructured":"Ports , D. R. , Clements , A. T. , Zhang , I. , Madden , S. , and Liskov , B . Transactional Consistency and Automatic Management in an Application Data Cache . In OSDI ( 2010 ), pp. 279 -- 292 . Ports, D. R., Clements, A. T., Zhang, I., Madden, S., and Liskov, B. Transactional Consistency and Automatic Management in an Application Data Cache. In OSDI (2010), pp. 279--292."},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/151634.151639"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536222.2536232"},{"key":"e_1_2_1_42_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01733-9","volume-title":"A Primer on Memory Consistency and Cache Coherence. Synthesis Lectures on Computer Architecture","author":"Sorin D. J.","year":"2011","unstructured":"Sorin , D. J. , Hill , M. D. , and Wood , D. A . A Primer on Memory Consistency and Cache Coherence. Synthesis Lectures on Computer Architecture ( 2011 ), 1--212. Sorin, D. J., Hill, M. D., and Wood, D. A. A Primer on Memory Consistency and Cache Coherence. Synthesis Lectures on Computer Architecture (2011), 1--212."},{"key":"e_1_2_1_43_1","volume-title":"CHARME","author":"Stern U.","year":"1995","unstructured":"Stern , U. , and Dill , D. L . Automatic Verification of the SCI Cache Coherence Protocol . In CHARME ( 1995 ). Stern, U., and Dill, D. L. Automatic Verification of the SCI Cache Coherence Protocol. In CHARME (1995)."},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064031"},{"key":"e_1_2_1_45_1","unstructured":"The Transaction Processing Council. TPC-C Benchmark (Revision 5.9.0) June 2007.  The Transaction Processing Council. TPC-C Benchmark (Revision 5.9.0) June 2007."},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815419"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067427"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915202"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2735508.2735511"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.12"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/2904121.2904126"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055335"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1109\/HOTI.2010.24"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3231751.3231763","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T10:41:58Z","timestamp":1672224118000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3231751.3231763"}},"subtitle":["harmonizing concurrency control and caching in a distributed OLTP database management system"],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":56,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["10.14778\/3231751.3231763"],"URL":"https:\/\/doi.org\/10.14778\/3231751.3231763","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,6]]}}}