{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T03:18:53Z","timestamp":1758079133183,"version":"3.44.0"},"reference-count":84,"publisher":"Association for Computing Machinery (ACM)","issue":"12","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2025,8]]},"abstract":"<jats:p>Mammoth transactions, which involve long-running operations that access many items, are common in graph workloads. Graph analytics tasks, including pattern matching and graph algorithms, can generate large read-write operations that impact significant portions of data, which makes their execution challenging under strict isolation guarantees. Consequently, we face an apparent trade-off between ensuring high isolation and achieving high performance, forcing users to choose between the two.<\/jats:p>\n          <jats:p>In this work, we present TuskFlow, an experimental graph database based on Neo4j, designed to efficiently handle mammoth transactions on graphs (the technique is applicable to other models such as relational) while maintaining existing transactional semantics. TuskFlow employs a deterministic protocol that safely reorders regular transactions around mammoths within an epoch. Our protocol supports parallel mammoth execution inspired by graph-parallel algorithms. To minimize conflicts with regular transactions, TuskFlow introduces query- and workload-aware optimizations, including graph entity tagging and partitioning. Our experiments demonstrate that, unlike traditional protocols like two-phase locking or MVCC, TuskFlow avoids blocking write transactions and improves tail latency by up to 45\u00d7.<\/jats:p>","DOI":"10.14778\/3750601.3750603","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T13:38:05Z","timestamp":1758029885000},"page":"4777-4790","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["TuskFlow: An Efficient Graph Database for Long-Running Transactions"],"prefix":"10.14778","volume":"18","author":[{"given":"Georgios","family":"Theodorakis","sequence":"first","affiliation":[{"name":"NVIDIA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hugo","family":"Firth","sequence":"additional","affiliation":[{"name":"Neo4j"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Clarkson","sequence":"additional","affiliation":[{"name":"Neo4j"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natacha","family":"Crooks","sequence":"additional","affiliation":[{"name":"UC Berkeley"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jim","family":"Webber","sequence":"additional","affiliation":[{"name":"Neo4j"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,9,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Daniel J Abadi and Jose M Faleiro. 2018. An overview of deterministic database systems. Commun. ACM. (2018).","DOI":"10.1145\/3181853"},{"key":"e_1_2_1_2_1","volume-title":"https:\/\/aws.amazon.com\/neptune\/. Last access","author":"Neptune Amazon","year":"2025","unstructured":"Amazon Neptune. 2024. https:\/\/aws.amazon.com\/neptune\/. Last access: July 21, 2025."},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Konstantin Andreev and Harald R\u00e4cke. 2004. Balanced graph partitioning. In SPAA.","DOI":"10.1145\/1007912.1007931"},{"key":"e_1_2_1_4_1","volume-title":"Foundations of modern query languages for graph databases. CSUR","author":"Angles Renzo","year":"2017","unstructured":"Renzo Angles, Marcelo Arenas, Pablo Barcel\u00f3, Aidan Hogan, Juan Reutter, and Domagoj Vrgo\u010d. 2017. Foundations of modern query languages for graph databases. CSUR (2017)."},{"key":"e_1_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Timothy G Armstrong Vamsi Ponnekanti Dhruba Borthakur and Mark Callaghan. 2013. Linkbench: a database benchmark based on the facebook social graph. In SIGMOD.","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Joy Arulraj Andrew Pavlo and Prashanth Menon. 2016. Bridging the archipelago between row-stores and column-stores for hybrid workloads. In SIGMOD.","DOI":"10.1145\/2882903.2915231"},{"key":"e_1_2_1_7_1","volume-title":"Proc. VLDB Endow.","author":"Athanassoulis Manoussos","year":"2019","unstructured":"Manoussos Athanassoulis, Kenneth B\u00f8gh, and Stratos Idreos. 2019. Optimal column layout for hybrid workloads. Proc. VLDB Endow. (2019)."},{"key":"e_1_2_1_8_1","volume-title":"Proc. Int. Semant. Web Conf.","author":"Auer S\u00f6ren","year":"2007","unstructured":"S\u00f6ren Auer, Christian Bizer, Georgi Kobilarov, Jens Lehmann, Richard Cyganiak, and Zachary Ives. 2007. Dbpedia: A nucleus for a web of open data. In Proc. Int. Semant. Web Conf."},{"key":"e_1_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Lars Backstrom Dan Huttenlocher Jon Kleinberg and Xiangyang Lan. 2006. Group formation in large social networks: membership growth and evolution. In SIGKDD.","DOI":"10.1145\/1150402.1150412"},{"key":"e_1_2_1_10_1","volume-title":"Multiversion concurrency control\u2014theory and algorithms. TODS","author":"Bernstein Philip A","year":"1983","unstructured":"Philip A Bernstein and Nathan Goodman. 1983. Multiversion concurrency control\u2014theory and algorithms. TODS (1983)."},{"key":"e_1_2_1_11_1","unstructured":"Philip A Bernstein Vassos Hadzilacos Nathan Goodman et al. 1987. Concurrency control and recovery in database systems. Addison-wesley Reading."},{"key":"e_1_2_1_12_1","volume-title":"Transaction Scheduling: From Conflicts to Runtime Conflicts. PACMMOD","author":"Cao Yang","year":"2023","unstructured":"Yang Cao, Wenfei Fan, Weijie Ou, Rui Xie, and Wenyue Zhao. 2023. Transaction Scheduling: From Conflicts to Runtime Conflicts. PACMMOD (2023)."},{"key":"e_1_2_1_13_1","volume-title":"Graphalytics: A big data benchmark for graph-processing platforms. In GRADES.","author":"Capot\u0103 Mihai","year":"2015","unstructured":"Mihai Capot\u0103, Tim Hegeman, Alexandru Iosup, Arnau Prat-P\u00e9rez, Orri Erling, and Peter Boncz. 2015. Graphalytics: A big data benchmark for graph-processing platforms. In GRADES."},{"key":"e_1_2_1_14_1","volume-title":"Better bitmap performance with roaring bitmaps. Software: practice and experience","author":"Chambi Samy","year":"2016","unstructured":"Samy Chambi, Daniel Lemire, Owen Kaser, and Robert Godin. 2016. Better bitmap performance with roaring bitmaps. Software: practice and experience (2016)."},{"key":"e_1_2_1_15_1","volume-title":"Proc. VLDB Endow.","author":"Chen Jianjun","year":"2022","unstructured":"Jianjun Chen, Yonghua Ding, Ye Liu, Fangshi Li, Li Zhang, Mingyi Zhang, Kui Wei, Lixun Cao, Dan Zou, Yang Liu, et al. 2022. ByteHTAP: bytedance's HTAP system with high data freshness and strong data consistency. Proc. VLDB Endow. (2022)."},{"key":"e_1_2_1_16_1","volume-title":"Proc. VLDB Endow.","author":"Cheng Audrey","year":"2024","unstructured":"Audrey Cheng, Aaron Kabcenell, Jason Chan, Xiao Shi, Peter Bailis, Natacha Crooks, and Ion Stoica. 2024. Towards Optimal Transaction Scheduling. Proc. VLDB Endow. (2024)."},{"key":"e_1_2_1_17_1","volume-title":"Proc. VLDB Endow.","author":"Cheng Audrey","year":"2022","unstructured":"Audrey Cheng, Xiao Shi, Aaron Kabcenell, Shilpa Lawande, Hamza Qadeer, Jason Chan, Harrison Tin, Ryan Zhao, Peter Bailis, Mahesh Balakrishnan, et al. 2022. Taobench: An end-to-end benchmark for social network workloads. Proc. VLDB Endow. (2022)."},{"key":"e_1_2_1_18_1","volume-title":"Proc. VLDB Endow.","author":"Cheng Audrey","year":"2024","unstructured":"Audrey Cheng, Jack Waudby, Hugo Firth, Natacha Crooks, and Ion Stoica. 2024. Mammoths Are Slow: The Overlooked Transactions of Graph Data. Proc. VLDB Endow. (2024)."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2824032.2824077"},{"key":"e_1_2_1_20_1","unstructured":"CNBC. 2018. Amazon's move off Oracle caused Prime Day outage in one of its biggest warehouses internal report says. https:\/\/www.cnbc.com\/2018\/10\/23\/amazonmove-off-oracle-caused-prime-day-outage-in-warehouse.html. Last access: July 21 2025."},{"key":"e_1_2_1_21_1","volume-title":"How online schema changes are possible in CockroachDB. https:\/\/www.cockroachlabs.com\/blog\/how-online-schema-changes-arepossible-in-cockroachdb\/. Last access","author":"DB.","year":"2025","unstructured":"CockroachDB. 2016. How online schema changes are possible in CockroachDB. https:\/\/www.cockroachlabs.com\/blog\/how-online-schema-changes-arepossible-in-cockroachdb\/. Last access: July 21, 2025."},{"key":"e_1_2_1_22_1","volume-title":"Nested transactions in CockroachDB 20.1. https:\/\/www.cockroachlabs.com\/blog\/nested-transactions-in-cockroachdb-20-1\/. Last access","author":"DB.","year":"2025","unstructured":"CockroachDB. 2020. Nested transactions in CockroachDB 20.1. https:\/\/www.cockroachlabs.com\/blog\/nested-transactions-in-cockroachdb-20-1\/. Last access: July 21, 2025."},{"key":"e_1_2_1_23_1","volume-title":"Htapbench: Hybrid transactional and analytical processing benchmark. In ICPE.","author":"Coelho F\u00e1bio","year":"2017","unstructured":"F\u00e1bio Coelho, Jo\u00e3o Paulo, Ricardo Vila\u00e7a, Jos\u00e9 Pereira, and Rui Oliveira. 2017. Htapbench: Hybrid transactional and analytical processing benchmark. In ICPE."},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Richard Cole Florian Funke Leo Giakoumakis Wey Guy Alfons Kemper Stefan Krompass Harumi Kuno Raghunath Nambiar Thomas Neumann Meikel Poess et al. 2011. The mixed workload CH-benCHmark. In DBTest.","DOI":"10.1145\/1988842.1988850"},{"key":"e_1_2_1_25_1","volume-title":"https:\/\/github.com\/eclipse\/eclipse-collections. Last access","author":"Collections Eclipse","year":"2025","unstructured":"Eclipse Collections. 2024. https:\/\/github.com\/eclipse\/eclipse-collections. Last access: July 21, 2025."},{"key":"e_1_2_1_26_1","volume-title":"Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, et al.","author":"Corbett James C","year":"2013","unstructured":"James C Corbett, Jeffrey Dean, Michael Epstein, Andrew Fikes, Christopher Frost, Jeffrey John Furman, Sanjay Ghemawat, Andrey Gubarev, Christopher Heiser, Peter Hochschild, et al. 2013. Spanner: Google's globally distributed database. TOCS (2013)."},{"key":"e_1_2_1_27_1","volume-title":"Graph Database Market Worth $5.1 Billion by","year":"2026","unstructured":"Datanami. 2021. Graph Database Market Worth $5.1 Billion by 2026. https:\/\/www.datanami.com\/this-just-in\/graph-database-market-worth-5-1-billion-by-2026\/. Last access: July 21, 2025."},{"key":"e_1_2_1_28_1","volume-title":"Dynamics On and Of Complex Networks","author":"Delvenne Jean-Charles","year":"2013","unstructured":"Jean-Charles Delvenne, Michael T Schaub, Sophia N Yaliraki, and Mauricio Barahona. 2013. The stability of a graph partition: A dynamics-based framework for community detection. Dynamics On and Of Complex Networks, Volume 2: Applications to Time-Varying Dynamical Systems (2013)."},{"key":"e_1_2_1_29_1","volume-title":"Stability of graph communities across time scales. PNAS","author":"Delvenne J-C","year":"2010","unstructured":"J-C Delvenne, Sophia N Yaliraki, and Mauricio Barahona. 2010. Stability of graph communities across time scales. PNAS (2010)."},{"key":"e_1_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Alin Deutsch Nadime Francis Alastair Green Keith Hare Bei Li Leonid Libkin Tobias Lindaaker Victor Marsault Wim Martens Jan Michels et al. 2022. Graph pattern matching in GQL and SQL\/PGQ. In SIGMOD.","DOI":"10.1145\/3514221.3526057"},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Orri Erling Alex Averbuch Josep Larriba-Pey Hassan Chafi Andrey Gubichev Arnau Prat Minh-Duc Pham and Peter Boncz. 2015. The LDBC social network benchmark: Interactive workload. In SIGMOD.","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_2_1_32_1","volume-title":"Traiger","author":"Eswaran Kapali P.","year":"1976","unstructured":"Kapali P. Eswaran, Jim N Gray, Raymond A. Lorie, and Irving L. Traiger. 1976. The notions of consistency and predicate locks in a database system. Commun. ACM. (1976)."},{"key":"e_1_2_1_33_1","volume-title":"TAPER: query-aware, partition-enhancement for large, heterogenous graphs. Distributed and Parallel Databases","author":"Firth Hugo","year":"2017","unstructured":"Hugo Firth and Paolo Missier. 2017. TAPER: query-aware, partition-enhancement for large, heterogenous graphs. Distributed and Parallel Databases (2017)."},{"key":"e_1_2_1_34_1","volume-title":"Loom: Query-aware Partitioning of Online Graphs. In EDBT.","author":"Firth Hugo","year":"2018","unstructured":"Hugo Firth, Paolo Missier, and Jack Aiston. 2018. Loom: Query-aware Partitioning of Online Graphs. In EDBT."},{"key":"e_1_2_1_35_1","volume-title":"Cypher: An evolving query language for property graphs. In SIGMOD.","author":"Francis Nadime","year":"2018","unstructured":"Nadime Francis, Alastair Green, Paolo Guagliardo, Leonid Libkin, Tobias Lindaaker, Victor Marsault, Stefan Plantikow, Mats Rydberg, Petra Selmer, and Andr\u00e9s Taylor. 2018. Cypher: An evolving query language for property graphs. In SIGMOD."},{"key":"e_1_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Hector Garcia-Molina and Kenneth Salem. 1987. Sagas. Sigmod Record (1987).","DOI":"10.1145\/38713.38742"},{"key":"e_1_2_1_37_1","volume-title":"Neptune: Scheduling suspendable tasks for uni!ed stream\/batch applications. In SOCC.","author":"Garefalakis Panagiotis","year":"2019","unstructured":"Panagiotis Garefalakis, Konstantinos Karanasos, and Peter Pietzuch. 2019. Neptune: Scheduling suspendable tasks for uni!ed stream\/batch applications. In SOCC."},{"key":"e_1_2_1_38_1","unstructured":"Jim Gray et al. 1981. The transaction concept: Virtues and limitations. In VLDB."},{"key":"e_1_2_1_39_1","volume-title":"Proc. VLDB Endow.","author":"Gray Jim N","year":"1975","unstructured":"Jim N Gray, Raymond A Lorie, and Gianfranco R Putzolu. 1975. Granularity of locks in a shared data base. Proc. VLDB Endow. (1975)."},{"key":"e_1_2_1_40_1","doi-asserted-by":"crossref","unstructured":"Stavros Harizopoulos Daniel J. Abadi Samuel Madden and Michael Stonebraker. 2008. OLTP through the looking glass and what we found there. In SIGMOD.","DOI":"10.1145\/1376616.1376713"},{"key":"e_1_2_1_41_1","volume":"201","author":"Huang Jiewen","unstructured":"Jiewen Huang and Daniel J Abadi. 2016. Leopard: Lightweight edge-oriented partitioning and replication for dynamic graphs. Proc. VLDB Endow. (2016).","journal-title":"Daniel J Abadi."},{"key":"e_1_2_1_42_1","volume-title":"Olxpbench: Real-time, semantically consistent, and domain-specific are essential in benchmarking, designing, and implementing htap systems. In ICDE.","author":"Kang Guoxin","year":"2022","unstructured":"Guoxin Kang, Lei Wang, Wanling Gao, Fei Tang, and Jianfeng Zhan. 2022. Olxpbench: Real-time, semantically consistent, and domain-specific are essential in benchmarking, designing, and implementing htap systems. In ICDE."},{"key":"e_1_2_1_43_1","doi-asserted-by":"crossref","unstructured":"Jure Leskovec Daniel Huttenlocher and Jon Kleinberg. 2010. Governance in social media: A case study of the Wikipedia promotion process. In ICWSM.","DOI":"10.1609\/icwsm.v4i1.14013"},{"key":"e_1_2_1_44_1","unstructured":"Patrick Lewis Ethan Perez Aleksandra Piktus Fabio Petroni Vladimir Karpukhin Naman Goyal Heinrich K\u00fcttler Mike Lewis Wen-tau Yih Tim Rockt\u00e4schel et al. 2020. Retrieval-augmented generation for knowledge-intensive nlp tasks. NeurIPS (2020)."},{"key":"e_1_2_1_45_1","volume-title":"Proc. VLDB Endow.","author":"Li Feifei","year":"2019","unstructured":"Feifei Li. 2019. Cloud-native database systems at Alibaba: Opportunities and challenges. Proc. VLDB Endow. (2019)."},{"key":"e_1_2_1_46_1","volume-title":"Proc. VLDB Endow.","author":"Lu Yi","year":"2020","unstructured":"Yi Lu, Xiangyao Yu, Lei Cao, and Samuel Madden. 2020. Aria: a fast and practical deterministic OLTP database. Proc. VLDB Endow. (2020)."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.5555\/889959"},{"key":"e_1_2_1_48_1","volume-title":"James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski.","author":"Malewicz Grzegorz","year":"2010","unstructured":"Grzegorz Malewicz, Matthew H Austern, Aart JC Bik, James C Dehnert, Ilan Horn, Naty Leiser, and Grzegorz Czajkowski. 2010. Pregel: a system for large-scale graph processing. In SIGMOD."},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920886"},{"key":"e_1_2_1_50_1","volume-title":"https:\/\/memgraph.com\/. Last access","year":"2025","unstructured":"MemGraph. 2024. https:\/\/memgraph.com\/. Last access: July 21, 2025."},{"key":"e_1_2_1_51_1","volume-title":"Graph algorithms: practical examples in Apache Spark and Neo4j","author":"Needham Mark","unstructured":"Mark Needham and Amy E Hodler. 2019. Graph algorithms: practical examples in Apache Spark and Neo4j. O'Reilly Media."},{"key":"e_1_2_1_52_1","volume-title":"Neo4j Graph Data Platform. https:\/\/neo4j.com\/. Last access","year":"2025","unstructured":"Neo4j. 2010. Neo4j Graph Data Platform. https:\/\/neo4j.com\/. Last access: July 21, 2025."},{"key":"e_1_2_1_53_1","volume-title":"Neo4j Breaks Scale Barrier with Trillion+ Relationship Graph. https:\/\/neo4j.com\/press-releases\/neo4j-scales-trillion-plus-relationship-graph\/. Last access","year":"2025","unstructured":"Neo4j. 2021. Neo4j Breaks Scale Barrier with Trillion+ Relationship Graph. https:\/\/neo4j.com\/press-releases\/neo4j-scales-trillion-plus-relationship-graph\/. Last access: July 21, 2025."},{"key":"e_1_2_1_54_1","volume-title":"Coordinate parallel transactions. https:\/\/neo4j.com\/docs\/java-manual\/current\/bookmarks\/. Last access","year":"2025","unstructured":"Neo4j. 2024. Coordinate parallel transactions. https:\/\/neo4j.com\/docs\/java-manual\/current\/bookmarks\/. Last access: July 21, 2025."},{"key":"e_1_2_1_55_1","volume-title":"Forseti Lock Manager. https:\/\/github.com\/neo4j\/neo4j\/blob\/5.16\/community\/lock\/src\/main\/java\/org\/neo4j\/kernel\/impl\/locking\/forseti\/ForsetiLockManager.java. Last access","year":"2025","unstructured":"Neo4j. 2024. Forseti Lock Manager. https:\/\/github.com\/neo4j\/neo4j\/blob\/5.16\/community\/lock\/src\/main\/java\/org\/neo4j\/kernel\/impl\/locking\/forseti\/ForsetiLockManager.java. Last access: July 21, 2025."},{"key":"e_1_2_1_56_1","volume-title":"Neo4j Graph Data Science. https:\/\/github.com\/neo4j\/graph-data-science. Last access","year":"2025","unstructured":"Neo4j. 2024. Neo4j Graph Data Science. https:\/\/github.com\/neo4j\/graph-data-science. Last access: July 21, 2025."},{"key":"e_1_2_1_57_1","volume-title":"User-defined procedures. https:\/\/neo4j.com\/docs\/java-reference\/current\/extending-neo4j\/procedures\/. Last access","year":"2025","unstructured":"Neo4j. 2024. User-defined procedures. https:\/\/neo4j.com\/docs\/java-reference\/current\/extending-neo4j\/procedures\/. Last access: July 21, 2025."},{"key":"e_1_2_1_58_1","doi-asserted-by":"crossref","unstructured":"Anil Pacaci and M Tamer \u00d6zsu. 2019. Experimental analysis of streaming algorithms for graph partitioning. In sigmod.","DOI":"10.1145\/3299869.3300076"},{"key":"e_1_2_1_59_1","doi-asserted-by":"publisher","DOI":"10.5555\/889820"},{"key":"e_1_2_1_60_1","volume-title":"PostgreSQL 15 Documentation SAVEPOINT. https:\/\/www.postgresql.org\/docs\/current\/sql-savepoint.html. Last access","author":"SQL.","year":"2025","unstructured":"PostgreSQL. 2023. PostgreSQL 15 Documentation SAVEPOINT. https:\/\/www.postgresql.org\/docs\/current\/sql-savepoint.html. Last access: July 21, 2025."},{"key":"e_1_2_1_61_1","volume-title":"Proc. VLDB Endow.","author":"Rae Ian","year":"2013","unstructured":"Ian Rae, Eric Rollins, Jeff Shute, Sukhdeep Sodhi, and Radek Vingralek. 2013. Online, asynchronous schema change in F1. Proc. VLDB Endow. (2013)."},{"key":"e_1_2_1_62_1","unstructured":"Ian Robinson Jim Webber and Emil Eifrem. 2015. Graph databases: new opportunities for connected data."},{"key":"e_1_2_1_63_1","volume-title":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. http:\/\/networkrepository.com","author":"Ryan","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence. http:\/\/networkrepository.com"},{"key":"e_1_2_1_64_1","volume-title":"Presto: SQL on everything. In ICDE.","author":"Sethi Raghav","year":"2019","unstructured":"Raghav Sethi, Martin Traverso, Dain Sundstrom, David Phillips, Wenlei Xie, Yutian Sun, Nezih Yegitbasi, Haozhun Jin, Eric Hwang, Nileema Shingte, et al. 2019. Presto: SQL on everything. In ICDE."},{"key":"e_1_2_1_65_1","doi-asserted-by":"crossref","unstructured":"Yangjun Sheng Anthony Tomasic Tieying Zhang and Andrew Pavlo. 2019. Scheduling OLTP transactions via learned abort prediction. In aiDM.","DOI":"10.1145\/3329859.3329871"},{"key":"e_1_2_1_66_1","doi-asserted-by":"crossref","unstructured":"Isabelle Stanton and Gabriel Kliot. 2012. Streaming graph partitioning for large distributed graphs. In SIGKDD.","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_2_1_67_1","volume-title":"Proc. VLDB Endow.","author":"Sz\u00e1rnyas G\u00e1bor","year":"2022","unstructured":"G\u00e1bor Sz\u00e1rnyas, Jack Waudby, Benjamin A Steer, D\u00e1vid Szak\u00e1llas, Altan Birler, Mingxi Wu, Yuchen Zhang, and Peter Boncz. 2022. The LDBC social network benchmark: Business intelligence workload. Proc. VLDB Endow. (2022)."},{"key":"e_1_2_1_68_1","volume-title":"Aion: Efficient Temporal Graph Data Management.. In EDBT.","author":"Theodorakis Georgios","year":"2024","unstructured":"Georgios Theodorakis, James Clarkson, and Jim Webber. 2024. Aion: Efficient Temporal Graph Data Management.. In EDBT."},{"key":"e_1_2_1_69_1","doi-asserted-by":"crossref","unstructured":"Georgios Theodorakis James Clarkson and Jim Webber. 2024. An Empirical Evaluation of Variable-length Record B+ Trees on a Modern Graph Database System. In ICDEW.","DOI":"10.1109\/ICDEW61823.2024.00051"},{"key":"e_1_2_1_70_1","volume-title":"Lightsaber: Efficient window aggregation on multi-core processors. In SIGMOD.","author":"Theodorakis Georgios","year":"2020","unstructured":"Georgios Theodorakis, Alexandros Koliousis, Peter Pietzuch, and Holger Pirk. 2020. Lightsaber: Efficient window aggregation on multi-core processors. In SIGMOD."},{"key":"e_1_2_1_71_1","volume":"201","author":"Thomson Alexander","unstructured":"Alexander Thomson and Daniel J Abadi. 2010. The case for determinism in database systems. Proc. VLDB Endow. (2010).","journal-title":"Daniel J Abadi."},{"key":"e_1_2_1_72_1","volume":"201","author":"Thomson Alexander","unstructured":"Alexander Thomson, Thaddeus Diamond, Shu-Chun Weng, Kun Ren, Philip Shao, and Daniel J Abadi. 2012. Calvin: fast distributed transactions for partitioned database systems. In SIGMOD.","journal-title":"Daniel J Abadi."},{"key":"e_1_2_1_73_1","volume-title":"Proc. VLDB Endow.","author":"Tian Boyu","year":"2018","unstructured":"Boyu Tian, Jiamin Huang, Barzan Mozafari, and Grant Schoenebeck. 2018. Contention-aware lock scheduling for transactional databases. Proc. VLDB Endow. (2018)."},{"key":"e_1_2_1_74_1","volume-title":"https:\/\/www.tigergraph.com\/. Last access","year":"2025","unstructured":"TigerGraph. 2024. https:\/\/www.tigergraph.com\/. Last access: July 21, 2025."},{"key":"e_1_2_1_75_1","volume-title":"Proc. VLDB Endow.","author":"Tong Bing","year":"2024","unstructured":"Bing Tong, Yan Zhou, Chen Zhang, Jianheng Tang, Jing Tang, Leihong Yang, Qiye Li, Manwu Lin, Zhongxin Bao, Jia Li, et al. 2024. Galaxybase: A High Performance Native Distributed Graph Database for HTAP. Proc. VLDB Endow. (2024)."},{"key":"e_1_2_1_76_1","volume-title":"TPC BENCHMARK C Standard Specification Revision 5.11. https:\/\/www.tpc.org\/TPC_Documents_Current_Versions\/pdf\/tpc-c_v5.11.0.pdf. Last access","author":"TPC.","year":"2025","unstructured":"TPC. 2010. TPC BENCHMARK C Standard Specification Revision 5.11. https:\/\/www.tpc.org\/TPC_Documents_Current_Versions\/pdf\/tpc-c_v5.11.0.pdf. Last access: July 21, 2025."},{"key":"e_1_2_1_77_1","volume-title":"https:\/\/www.tpc.org\/TPC_Documents_Current_Versions\/pdf\/TPC-H_v3.0.1.pdf. Last access","author":"Decision TPC.","year":"2025","unstructured":"TPC. 2022. TPC BENCHMARK H (Decision Support) Standard Specification Revision 3.0.1. https:\/\/www.tpc.org\/TPC_Documents_Current_Versions\/pdf\/TPC-H_v3.0.1.pdf. Last access: July 21, 2025."},{"key":"e_1_2_1_78_1","doi-asserted-by":"publisher","DOI":"10.1145\/2556195.2556213"},{"key":"e_1_2_1_79_1","unstructured":"Stephen Tu Wenting Zheng Eddie Kohler Barbara Liskov and Samuel Madden. 2013. Speedy transactions in multicore in-memory databases. In SOSP."},{"key":"e_1_2_1_80_1","doi-asserted-by":"crossref","unstructured":"Johan Ugander and Lars Backstrom. 2013. Balanced label propagation for partitioning massive graphs. In WSDM.","DOI":"10.1145\/2433396.2433461"},{"key":"e_1_2_1_81_1","doi-asserted-by":"crossref","unstructured":"Jack Waudby Paul Ezhilchelvan Jim Webber and Isi Mitrani. 2020. Preserving reciprocal consistency in distributed graph databases. In PaPoC.","DOI":"10.1145\/3380787.3393675"},{"key":"e_1_2_1_82_1","volume-title":"Proc. VLDB Endow.","author":"Wu Huanhuan","year":"2014","unstructured":"Huanhuan Wu, James Cheng, Silu Huang, Yiping Ke, Yi Lu, and Yanyan Xu. 2014. Path problems in temporal graphs. Proc. VLDB Endow. (2014)."},{"key":"e_1_2_1_83_1","volume-title":"Graphx: A resilient distributed graph system on spark. In GRADES.","author":"Xin Reynold S","year":"2013","unstructured":"Reynold S Xin, Joseph E Gonzalez, Michael J Franklin, and Ion Stoica. 2013. Graphx: A resilient distributed graph system on spark. In GRADES."},{"key":"e_1_2_1_84_1","volume-title":"Proc. VLDB Endow.","author":"Zhan Chaoqun","year":"2019","unstructured":"Chaoqun Zhan, Maomeng Su, Chuangxian Wei, Xiaoqiang Peng, Liang Lin, Sheng Wang, Zhe Chen, Feifei Li, Yue Pan, Fang Zheng, et al. 2019. AnalyticDB: real-time OLAP database system at Alibaba cloud. Proc. VLDB Endow. (2019)."}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3750601.3750603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T13:43:43Z","timestamp":1758030223000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3750601.3750603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8]]},"references-count":84,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,8]]}},"alternative-id":["10.14778\/3750601.3750603"],"URL":"https:\/\/doi.org\/10.14778\/3750601.3750603","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2025,8]]},"assertion":[{"value":"2025-09-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}