{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:26:42Z","timestamp":1767094002772,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,1,6]]},"DOI":"10.1145\/3772290.3772311","type":"proceedings-article","created":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:18Z","timestamp":1767093858000},"page":"123-127","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Dito: Distributed Transactional Objects"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6771-0776","authenticated-orcid":false,"given":"Lukas","family":"Epple","sequence":"first","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5238-6015","authenticated-orcid":false,"given":"Simon","family":"K\u00f6nig","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9036-1410","authenticated-orcid":false,"given":"Christian","family":"Becker","sequence":"additional","affiliation":[{"name":"University of Stuttgart, Stuttgart, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","unstructured":"Atul Adya Robert Gruber Barbara Liskov and Umesh Maheshwari. 1995. Efficient optimistic concurrency control using loosely synchronized clocks. SIGMOD Rec. 24 2 (may 1995) 23\u201334. 10.1145\/568271.223787","DOI":"10.1145\/568271.223787"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Peter Bailis Aaron Davidson Alan Fekete Ali Ghodsi Joseph\u00a0M. Hellerstein and Ion Stoica. 2013. Highly Available Transactions: Virtues and Limitations (Extended Version). arxiv:https:\/\/arXiv.org\/abs\/1302.0309\u00a0[cs.DB]","DOI":"10.14778\/2732232.2732237"},{"key":"e_1_3_3_1_4_2","first-page":"223","volume-title":"Proceedings of the Conference on Innovative Data system Research (CIDR)","author":"Baker Jason","year":"2011","unstructured":"Jason Baker, Chris Bond, James\u00a0C. Corbett, JJ Furman, Andrey Khorlin, James Larson, Jean-Michel Leon, Yawei Li, Alexander Lloyd, and Vadim Yushprakh. 2011. Megastore: Providing Scalable, Highly Available Storage for Interactive Services. In Proceedings of the Conference on Innovative Data system Research (CIDR). 223\u2013234."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.5555\/12518"},{"key":"e_1_3_3_1_6_2","first-page":"223","volume-title":"2012 USENIX Annual Technical Conference (USENIX ATC 12)","author":"Cowling James","year":"2012","unstructured":"James Cowling and Barbara Liskov. 2012. Granola: Low-Overhead Distributed Transaction Coordination. In 2012 USENIX Annual Technical Conference (USENIX ATC 12). USENIX Association, Boston, MA, 223\u2013235."},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815425"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","unstructured":"Rachael Harding Dana Van\u00a0Aken Andrew Pavlo and Michael Stonebraker. 2017. An evaluation of distributed concurrency control. Proc. VLDB Endow. 10 5 (jan 2017) 553\u2013564. 10.14778\/3055540.3055548","DOI":"10.14778\/3055540.3055548"},{"key":"e_1_3_3_1_9_2","first-page":"185","volume-title":"12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16)","author":"Kalia Anuj","year":"2016","unstructured":"Anuj Kalia, Michael Kaminsky, and David\u00a0G. Andersen. 2016. FaSST: Fast, Scalable and Simple Distributed Transactions with Two-Sided (RDMA) Datagram RPCs. In 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16). USENIX Association, Savannah, GA, 185\u2013201."},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"Junru Li Youyou Lu Yiming Zhang Qing Wang Zhuo Cheng Keji Huang and Jiwu Shu. 2022. SwitchTx: Scalable in-Network Coordination for Distributed Transaction Processing. Proc. VLDB Endow. 15 11 (jul 2022) 2881\u20132894. 10.14778\/3551793.3551838","DOI":"10.14778\/3551793.3551838"},{"key":"e_1_3_3_1_11_2","first-page":"104","volume-title":"Proceedings of the 26th Symposium on Operating Systems Principles","author":"Li Jialin","year":"2017","unstructured":"Jialin Li, Ellis Michael, and Dan\u00a0RK Ports. 2017. Eris: Coordination-free consistent transactions using in-network concurrency control. In Proceedings of the 26th Symposium on Operating Systems Principles. 104\u2013120."},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Hatem\u00a0A. Mahmoud Vaibhav Arora Faisal Nawab Divyakant Agrawal and Amr El\u00a0Abbadi. 2014. MaaT: Effective and Scalable Coordination of Distributed Transactions in the Cloud. Proc. VLDB Endow. 7 5 (jan 2014) 329\u2013340. 10.14778\/2732269.2732270","DOI":"10.14778\/2732269.2732270"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/2685048.2685086"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477132.3483555"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"crossref","unstructured":"Tim Soethout Tijs van\u00a0der Storm and Jurgen Vinju. 2020. Path-Sensitive Atomic Commit: Local Coordination Avoidance for Distributed Transactions. The Art Science and Engineering of Programming 5 1 (June 2020).","DOI":"10.22152\/programming-journal.org\/2021\/5\/3"},{"key":"e_1_3_3_1_16_2","unstructured":"Michael Stonebraker. 1986. The case for shared nothing. IEEE Database Eng. Bull. 9 1 (1986) 4\u20139."},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Y.\u00a0C. Tay Nathan Goodman and R. Suri. 1985. Locking performance in centralized databases. ACM Transactions on Database Systems 10 4 (Dec. 1985) 415\u2013462. 10.1145\/4879.4880","DOI":"10.1145\/4879.4880"},{"key":"e_1_3_3_1_18_2","volume-title":"Proceedings of the 2nd Workshop on Determinism and Correctness in Parallel Programming","volume":"5","author":"Thomson Alexander","year":"2011","unstructured":"Alexander Thomson and Daniel\u00a0J Abadi. 2011. Building deterministic transaction processing systems without deterministic thread scheduling. In Proceedings of the 2nd Workshop on Determinism and Correctness in Parallel Programming , Vol.\u00a05."},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_3_3_1_20_2","first-page":"132","volume-title":"TPC-C Benchmark Revision 5.11.0","author":"Council Transaction Processing Performance","year":"2010","unstructured":"Transaction Processing Performance Council. 2010. TPC-C Benchmark Revision 5.11.0. Technical Report. 132 pages."}],"event":{"name":"ICDCN 2026: 27th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2026","location":"Nara Japan"},"container-title":["Proceedings of the 27th International Conference on Distributed Computing and Networking"],"original-title":[],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:45Z","timestamp":1767093885000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3772290.3772311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":19,"alternative-id":["10.1145\/3772290.3772311","10.1145\/3772290"],"URL":"https:\/\/doi.org\/10.1145\/3772290.3772311","relation":{},"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"2026-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}