{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T19:49:38Z","timestamp":1774986578448,"version":"3.50.1"},"reference-count":60,"publisher":"Association for Computing Machinery (ACM)","issue":"3","funder":[{"DOI":"10.13039\/501100006374","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2024YFF0617702"],"award-info":[{"award-number":["2024YFF0617702"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["U22A2025, 62072088, 62232007, U23A20309, 61991404"],"award-info":[{"award-number":["U22A2025, 62072088, 62232007, U23A20309, 61991404"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Liaoning Provincial Science and Technology Plan Project - Key R&D Department of Science and Technology","award":["2023JH2\/101300182"],"award-info":[{"award-number":["2023JH2\/101300182"]}]},{"DOI":"10.13039\/501100013314","name":"111 Project","doi-asserted-by":"crossref","award":["B16009"],"award-info":[{"award-number":["B16009"]}],"id":[{"id":"10.13039\/501100013314","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>\n                    Deterministic databases are revolutionizing batch transaction processing in shared-nothing architectures, with efficiency largely hinging on minimizing cross-partition operations. However, achieving a universal data partition that eliminates cross-partition operations is often impractical. Thus, developing effective transaction partitioning strategies becomes crucial. Existing methods tend to partition and optimize transactions individually, neglecting the overarching commonalities between transactions within a batch. This oversight results in suboptimal partitioning of transactions that share similar read-write sets, ultimately missing opportunities for global batch execution optimization. In this paper, we present DelayPart, a deterministic database transaction engine that employs a ''wait and see'' strategy to address contextual conflicts between transactions within each batch. DelayPart models transaction batch partitioning as a\n                    <jats:italic toggle=\"yes\">k<\/jats:italic>\n                    -cut problem based on transaction similarity and employs a LSH forest-based approach to approximate solutions efficiently in linear time, factoring in the global overhead of remote operations for each batch. By postponing the allocation and execution of individual transactions, DelayPart systematically analyzes inter-transaction relationships, enhancing overall performance without compromising execution efficiency. We evaluated DelayPart's performance against various benchmarks on a large-scale cluster, demonstrating that it significantly outperforms state-of-the-art transaction partitioning methods.\n                  <\/jats:p>","DOI":"10.1145\/3725422","type":"journal-article","created":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:23:29Z","timestamp":1750281809000},"page":"1-27","source":"Crossref","is-referenced-by-count":0,"title":["Wait and See: A Delayed Transactions Partitioning Approach in Deterministic Database Systems for Better Performance"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7106-6312","authenticated-orcid":false,"given":"Yuan","family":"Sui","sequence":"first","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6184-4771","authenticated-orcid":false,"given":"Xiaochun","family":"Yang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2694-1023","authenticated-orcid":false,"given":"Bin","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-3913-6377","authenticated-orcid":false,"given":"Yujie","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, Northeastern University, Shenyang, Liaoning, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9792-9171","authenticated-orcid":false,"given":"Baihua","family":"Zheng","sequence":"additional","affiliation":[{"name":"Singapore Management University, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3181853"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060840"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/356842.356846"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234182"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01231700"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276781"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3588706"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921632.1921638"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807128.1807152"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920853"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3"},{"key":"e_1_2_1_12_1","volume-title":"Randomized contractions meet lean decompositions. CoRR, abs\/1810.06864. arXiv preprint arXiv:1810.06864","author":"Cygan Marek","year":"2018","unstructured":"Marek Cygan, Pawel Komosa, Daniel Lokshtanov, Michal Pilipczuk, Marcin Pilipczuk, and Saket Saurabh. 2018. Randomized contractions meet lean decompositions. CoRR, abs\/1810.06864. arXiv preprint arXiv:1810.06864 (2018)."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3282495.3282502"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(04)81014--4"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055540.3055553"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/2809974.2809981"},{"key":"e_1_2_1_17_1","volume-title":"A polynomial algorithm for the k-cut problem for fixed k. Mathematics of operations research","author":"Goldschmidt Olivier","year":"1994","unstructured":"Olivier Goldschmidt and Dorit S Hochbaum. 1994. A polynomial algorithm for the k-cut problem for fixed k. Mathematics of operations research, Vol. 19, 1 (1994), 24--37."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00020"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.179"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316395"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/0204007"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807233"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/1454159.1454211"},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 990--999","author":"Bingkai Lin Kawarabayashi","year":"2020","unstructured":"Ken-ichi Kawarabayashi and Bingkai Lin. 2020. A nearly 5\/3-approximation FPT algorithm for min-k-cut. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms. SIAM, 990--999."},{"key":"e_1_2_1_26_1","volume-title":"Don't Be Lazy","author":"Kemme Bettina","year":"2000","unstructured":"Bettina Kemme and Gustavo Alonso. 2000. Don't Be Lazy, Be Consistent: Postgres-R, A New Way to Implement Database Replication. In VLDB 2000, Proceedings of 26th International Conference on Very Large Data Bases, Amr El Abbadi, Michael L. Brodie, Sharma Chakravarthy, Umeshwar Dayal, Nabil Kamel, Gunter Schlageter, and Kyu-Young Whang (Eds.). Morgan Kaufmann, Cairo, Egypt, 134--143. http:\/\/www.vldb.org\/conf\/2000\/P134.pdf"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_28_1","volume-title":"Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002","author":"Lamport Leslie","year":"2002","unstructured":"Leslie Lamport. 2002. Paxos Made Simple, Fast, and Byzantine. In Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, Reims, France, December 11--13, 2002 (Studia Informatica Universalis, Vol. 3), Alain Bui and Hac\u00e8ne Fouchal (Eds.). Suger, Saint-Denis, rue Catulienne, France, 7--9."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2019.00068"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452827"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00079"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407808"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3446095.3446098"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2021.52"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/365411.365415"},{"key":"e_1_2_1_36_1","volume-title":"Finding and evaluating community structure in networks. Physical review E","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman and Michelle Girvan. 2004. Finding and evaluating community structure in networks. Physical review E, Vol. 69, 2 (2004), 026113."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589293"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920959"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989463"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/322154.322158"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389764"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.5441\/002\/EDBT.2020.08"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3151106.3151107"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882958"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732951.2732955"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185443"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/3299869.3319883"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"e_1_2_1_49_1","unstructured":"Abraham Silberschatz and Henry F Korth. 2020. Database system concepts. (2020)."},{"key":"e_1_2_1_50_1","volume-title":"Proceedings of the 33rd International Conference on Very Large Data Bases","author":"Stonebraker Michael","year":"2007","unstructured":"Michael Stonebraker, Samuel Madden, Daniel J. Abadi, Stavros Harizopoulos, Nabil Hachem, and Pat Helland. 2007. The End of an Architectural Era (It's Time for a Complete Rewrite). In Proceedings of the 33rd International Conference on Very Large Data Bases, University of Vienna, Austria, September 23--27, 2007. ACM, University of Vienna, Austria, 1150--1160. http:\/\/www.vldb.org\/conf\/2007\/papers\/industrial\/p1150-stonebraker.pdf"},{"key":"e_1_2_1_51_1","volume-title":"Elmore","author":"Tang Dixin","year":"2017","unstructured":"Dixin Tang, Hao Jiang, and Aaron J. Elmore. 2017. Adaptive Concurrency Control: Despite the Looking Glass, One Concurrency Control Does Not Fit All. In 8th Biennial Conference on Innovative Data Systems Research, CIDR 2017, Chaminade, CA, USA, January 8--11, 2017, Online Proceedings. www.cidrdb.org. http:\/\/cidrdb.org\/cidr2017\/papers\/p63-tang-cidr17.pdf"},{"key":"e_1_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920855"},{"key":"e_1_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213838"},{"key":"e_1_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376675"},{"key":"e_1_2_1_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2915227"},{"key":"e_1_2_1_57_1","first-page":"2553","article-title":"A review for weighted minhash algorithms","volume":"34","author":"Wu Wei","year":"2020","unstructured":"Wei Wu, Bin Li, Ling Chen, Junbin Gao, and Chengqi Zhang. 2020. A review for weighted minhash algorithms. IEEE Transactions on Knowledge and Data Engineering, Vol. 34, 6 (2020), 2553--2573.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_2_1_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281280"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551843"},{"key":"e_1_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687709"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725422","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:55:54Z","timestamp":1774983354000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725422"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":60,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725422"],"URL":"https:\/\/doi.org\/10.1145\/3725422","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}