{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:08:10Z","timestamp":1775912890916,"version":"3.50.1"},"reference-count":111,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:00:00Z","timestamp":1750204800000},"content-version":"vor","delay-in-days":1,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["IIS-1910216"],"award-info":[{"award-number":["IIS-1910216"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2025,6,17]]},"abstract":"<jats:p>This paper introduces GTX, a standalone main-memory write-optimized graph data system that specializes in structural and graph property updates while enabling concurrent reads and graph analytics through ACID transactions. Recent graph systems target concurrent read and write support while guaranteeing transaction semantics. However, their performance suffers from updates with real-world temporal locality over the same vertices and edges due to vertex-centric lock contentions. GTX has an adaptive delta-chain locking protocol on top of a carefully designed latch-free graph storage. It eliminates vertex-level locking contention, and adapts to real-life workloads while maintaining sequential access to the graph's adjacency lists storage. GTX's transactions further support cache-friendly block-level concurrency control, and cooperative group commit and garbage collection. This combination of features ensures high update throughput and provides low latency graph analytics. Based on experimental evaluation, in addition to not sacrificing the performance of read-heavy analytical workloads, and having competitive performance similar to state-of-the-art systems, GTX has high read-write transaction throughput. For write-heavy transactional workloads, GTX achieves up to 11X better transaction throughput than the best-performing state-of-the-art system.<\/jats:p>","DOI":"10.1145\/3725305","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":2,"title":["GTX: A Write-Optimized Latch-free Graph Data System with Transactional Support"],"prefix":"10.1145","volume":"3","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3050-181X","authenticated-orcid":false,"given":"Libin","family":"Zhou","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4369-4440","authenticated-orcid":false,"given":"Lu","family":"Xing","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0326-2965","authenticated-orcid":false,"given":"Yeasir","family":"Rayhan","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8169-7775","authenticated-orcid":false,"given":"Walid G.","family":"Aref","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2025,6,18]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"[n. d.]. . https:\/\/graphbase.ai\/"},{"key":"e_1_2_2_2_1","unstructured":"[n. d.]. RedisGraph. https:\/\/redis.io\/docs\/latest\/operate\/oss_and_stack\/stack-with-enterprise\/deprecated-features\/ graph\/"},{"key":"e_1_2_2_3_1","unstructured":"2013. New Tweets per second record and how! https:\/\/blog.twitter.com\/engineering\/en_us\/a\/2013\/new-tweets-persecond- record-and-how"},{"key":"e_1_2_2_4_1","unstructured":"2015. Hint Bits. https:\/\/wiki.postgresql.org\/wiki\/Hint_Bits"},{"key":"e_1_2_2_5_1","unstructured":"2019. China's Singles' Day shopping spree sees robust sales. http:\/\/www.xinhuanet.com\/english\/2019--11\/11\/c_ 138546429.htm"},{"key":"e_1_2_2_6_1","unstructured":"2020. OrientDB. https:\/\/orientdb.org\/"},{"key":"e_1_2_2_7_1","unstructured":"2022. LDBC benchmark data sets. https:\/\/ldbcouncil.org\/data-sets-surf-repository\/snb-interactive-v2-updates.html"},{"key":"e_1_2_2_8_1","unstructured":"2023. ByteDance. https:\/\/www.bytedance.com\/en\/"},{"key":"e_1_2_2_9_1","unstructured":"2024. Concurrent Data Access. https:\/\/neo4j.com\/docs\/operations-manual\/current\/database-internals\/concurrentdata- access\/#transactions-isolation-lostupdates"},{"key":"e_1_2_2_10_1","unstructured":"2024. Get Started with SAP HANA Graph. https:\/\/developers.sap.com\/group.hana-aa-graph-overview.html"},{"key":"e_1_2_2_11_1","unstructured":"2024. JanusGraph. https:\/\/janusgraph.org\/"},{"key":"e_1_2_2_12_1","unstructured":"2024. LDBC Graphalytics Benchmark (LDBC Graphalytics). https:\/\/ldbcouncil.org\/benchmarks\/graphalytics\/"},{"key":"e_1_2_2_13_1","unstructured":"2024. LDBC SNB Business Intelligence (BI) workload implementations. https:\/\/github.com\/ldbc\/ldbc_snb_bi"},{"key":"e_1_2_2_14_1","unstructured":"2024. LDBC SNB Interactive v2 workload implementations. https:\/\/github.com\/ldbc\/ldbc_snb_interactive_v1_impls# ldbc-snb-interactive-v2-workload-implementations"},{"key":"e_1_2_2_15_1","unstructured":"2024. Neo4j. https:\/\/neo4j.com\/"},{"key":"e_1_2_2_16_1","unstructured":"2024. OpenMP. https:\/\/www.openmp.org\/"},{"key":"e_1_2_2_17_1","unstructured":"2024. OQGRAPH Overview. https:\/\/mariadb.com\/kb\/en\/oqgraph-overview\/"},{"key":"e_1_2_2_18_1","unstructured":"2024. Oracle Big Data Spatial and Graph. https:\/\/www.oracle.com\/database\/technologies\/bigdata-spatialandgraph. html"},{"key":"e_1_2_2_19_1","unstructured":"2024. Spruce. https:\/\/github.com\/Stardust-SJF\/Spruce"},{"key":"e_1_2_2_20_1","volume-title":"Tim Hegeman and Peter Boncz","author":"Ngai Stijn Heldens Arnau Wing Lung","year":"2017","unstructured":"Wing Lung Ngai Stijn Heldens Arnau Prat-P\u00e9rez Thomas Manhardto Hassan Chafio Mihai Capota Narayanan Sundaram Michael Anderson Ilie Gabriel Tanase Yinglong Xia Lifeng Nai Alexandru Iosup, Tim Hegeman and Peter Boncz. 2017. LDBC Graphalytics Benchmark specification, v0.9.0."},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2926693.2929897"},{"key":"e_1_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3352063.3352131"},{"key":"e_1_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465296"},{"key":"e_1_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/3187009.3164147"},{"key":"e_1_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/165231.165265"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/568271.223785"},{"key":"e_1_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3131677"},{"key":"e_1_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Maciej Besta Robert Gerstenberger Marc Fischer Michal Podstawski J\u00fcrgen M\u00fcller Nils Blach Berke Egeli George Mitenkov Wojciech Chlapek Marek Michalewicz and Torsten Hoefler. 2023. The Graph Database Interface: Scaling Online Transactional and Analytical Graph Workloads to Hundreds of Thousands of Cores. arXiv:2305.11162 [cs.DB]","DOI":"10.1145\/3581784.3607068"},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3604932"},{"key":"e_1_2_2_30_1","unstructured":"Kai Zeng Bolin Ding and Wenyuan Yu. 2020. Alibaba Sponsor Talk at VLDB."},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3386135"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551813"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","unstructured":"Rong Chen Jiaxin Shi Yanzhe Chen Binyu Zang Haibing Guan and Haibo Chen. 2019. PowerLyra: Differentiated Graph Computation and Partitioning on Skewed Graphs. ACM Trans. Parallel Comput. (2019). doi:10.1145\/3298989","DOI":"10.1145\/3298989"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3538598.3538616"},{"key":"e_1_2_2_35_1","unstructured":"Audrey Cheng Jack Waudby Hugo Firth Natacha Crooks and Ion Stoica. [n. d.]. Mammoths Are Slow: The Overlooked Transactions of Graph Data. ([n. d.])."},{"key":"e_1_2_2_36_1","unstructured":"Miaomiao Cheng Jiujian Chen Cheng Zhao Cheng Chen Yongmin Hu Xiaoliang Cong Liang Qin Hexiang Lin Ronghua Li Guoren Wang Shuai Zhang and Lei Zhang. 2023. ByteGAP: A Non-continuous Distributed Graph Computing System using Persistent Memory (CEUR Workshop Proceedings). CEUR-WS.org. https:\/\/ceur-ws.org\/Vol- 3462\/ADMS7.pdf"},{"key":"e_1_2_2_37_1","unstructured":"Dean De Leo. [n. d.]. graphlog. https:\/\/github.com\/whatsthecraic\/graphlog"},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3327964.3328497"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447708"},{"key":"e_1_2_2_40_1","volume-title":"TigerGraph: A Native MPP Graph Database. (01","author":"Deutsch Alin","year":"2019","unstructured":"Alin Deutsch, Yu Xu, Mingxi Wu, and Victor Lee. 2019. TigerGraph: A Native MPP Graph Database. (01 2019)."},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314221.3314598"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/2983200"},{"key":"e_1_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2012.6408680"},{"key":"e_1_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2742786"},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316229"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476311.3476369"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2405.15193"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457263"},{"key":"e_1_2_2_50_1","unstructured":"Xiyang Feng Guodong Jin Ziyi Chen Chang Liu and Semih Salihoglu. 2023. K\u00d9ZU Graph Database Management System. CIDR."},{"key":"e_1_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs"},{"key":"e_1_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.14778\/3514061.3514065"},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644931"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476297"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.14778\/2733004.2733010"},{"key":"e_1_2_2_56_1","volume-title":"Extending In-Memory Relational Database Engines with Native Graph Support. In International Conference on Extending Database Technology. https:\/\/api.semanticscholar.org\/CorpusID:11389988","author":"Hassan Mohamed S.","year":"2018","unstructured":"Mohamed S. Hassan, Tatiana Kuznetsova, Hyun Chai Jeong,Walid G. Aref, and Mohammad Sadoghi. 2018. Extending In-Memory Relational Database Engines with Native Graph Support. In International Conference on Extending Database Technology. https:\/\/api.semanticscholar.org\/CorpusID:11389988"},{"key":"e_1_2_2_57_1","volume-title":"Graph Databases: New Opportunities for Connected Data","author":"Ian Robinson Jim Webber","year":"2015","unstructured":"Jim Webber Ian Robinson and Emil Eifrem. 2015. Graph Databases: New Opportunities for Connected Data (2nd ed.). O'Reilly Media, Inc.","edition":"2"},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16720-1_3"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007270"},{"key":"e_1_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.48786\/edbt.2023.60"},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056445"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2014.09.001"},{"key":"e_1_2_2_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/365628"},{"key":"e_1_2_2_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3364180"},{"key":"e_1_2_2_65_1","unstructured":"J\u00e9r\u00f4me Kunegis. [n. d.]. The KONECT Project. http:\/\/konect.cc\/networks\/"},{"key":"e_1_2_2_66_1","unstructured":"Geof Langdale. [n. d.]. Lock-Free Programming. https:\/\/www.cs.cmu.edu\/~410-s05\/lectures\/L31_LockFree.pdf"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.14778\/2095686.2095689"},{"key":"e_1_2_2_68_1","unstructured":"Dean De Leo. 2020. GFE Driver - Input graphs. https:\/\/zenodo.org\/records\/3966439"},{"key":"e_1_2_2_69_1","doi-asserted-by":"publisher","DOI":"10.1145\/2898361"},{"key":"e_1_2_2_70_1","volume-title":"The Bw-Tree: A B-tree for New Hardware Platforms. In 2013 IEEE 29th International Conference on Data Engineering (ICDE) (2013 ieee 29th international conference on data engineering (icde) ed.)","author":"Levandoski Justin","unstructured":"Justin Levandoski, David Lomet, and Sudipta Sengupta. 2013. The Bw-Tree: A B-tree for New Hardware Platforms. In 2013 IEEE 29th International Conference on Data Engineering (ICDE) (2013 ieee 29th international conference on data engineering (icde) ed.). IEEE. https:\/\/www.microsoft.com\/en-us\/research\/publication\/the-bw-tree-a-b-tree-for-newhardware\/"},{"key":"e_1_2_2_71_1","volume-title":"High Performance Transactions in Deuteronomy. In Conference on Innovative Data Systems Research (CIDR","author":"Levandoski Justin","year":"2015","unstructured":"Justin Levandoski, David Lomet, Sudipta Sengupta, Ryan Stutsman, and Rui Wang. 2015. High Performance Transactions in Deuteronomy. In Conference on Innovative Data Systems Research (CIDR 2015). https:\/\/www.microsoft.com\/enus\/ research\/publication\/high-performance-transactions-in-deuteronomy\/"},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.14778\/3554821.3554824"},{"key":"e_1_2_2_73_1","unstructured":"Hongfu Li. 2024. GastCoCo: Graph Storage and Coroutine-Based Prefetch Co-Design for Dynamic Graph Processing. arXiv:2312.14396 [cs.DB] https:\/\/arxiv.org\/abs\/2312.14396"},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/3533737.3535091"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064015"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.26599\/BDMA.2023.9020015"},{"key":"e_1_2_2_77_1","unstructured":"Memgraph Ltd. [n. d.]. Memgraph. https:\/\/memgraph.com\/"},{"key":"e_1_2_2_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113298"},{"key":"e_1_2_2_79_1","doi-asserted-by":"publisher","DOI":"10.1145\/2351476.2351489"},{"key":"e_1_2_2_80_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3457313"},{"key":"e_1_2_2_81_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00157"},{"key":"e_1_2_2_82_1","doi-asserted-by":"crossref","unstructured":"David P\u00fcroja JackWaudby Peter Boncz and G\u00e1bor Sz\u00e1rnyas. 2023. The LDBC Social Network Benchmark Interactive workload v2: A transactional graph query benchmark with deep delete operations. arXiv:2307.04820 [cs.DB]","DOI":"10.1007\/978-3-031-68031-1_8"},{"key":"e_1_2_2_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3627703.3650076"},{"key":"e_1_2_2_84_1","doi-asserted-by":"publisher","DOI":"10.14778\/3229863.3229874"},{"key":"e_1_2_2_85_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.7982"},{"key":"e_1_2_2_86_1","doi-asserted-by":"publisher","DOI":"10.1145\/3186728.3164139"},{"key":"e_1_2_2_87_1","unstructured":"HANS-J\u00dcRGEN SCH\u00d6NIG. 2023. Speeding up things with hint bits. https:\/\/www.cybertec-postgresql.com\/en\/speedingup- things-with-hint-bits\/"},{"key":"e_1_2_2_88_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2467799"},{"key":"e_1_2_2_89_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007267"},{"key":"e_1_2_2_90_1","doi-asserted-by":"publisher","DOI":"10.14778\/3007263.3007267"},{"key":"e_1_2_2_91_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384354"},{"key":"e_1_2_2_92_1","volume-title":"15th USENIX Symposium on Operating Systems Design and Implementation (OSDI 21)","author":"Shen Sijie","year":"2021","unstructured":"Sijie Shen, Rong Chen, Haibo Chen, and Binyu Zang. 2021. Retrofitting High Availability Mechanism to Tame Hybrid Transaction\/Analytical Processing. In 15th USENIX Symposium on Operating Systems Design and Implementation (OSDI 21). USENIX Association, 219--238. https:\/\/www.usenix.org\/conference\/osdi21\/presentation\/shen"},{"key":"e_1_2_2_93_1","volume-title":"2023 USENIX Annual Technical Conference (USENIX ATC 23)","author":"Shen Sijie","year":"2023","unstructured":"Sijie Shen, Zihang Yao, Lin Shi, Lei Wang, Longbin Lai, Qian Tao, Li Su, Rong Chen, Wenyuan Yu, Haibo Chen, Binyu Zang, and Jingren Zhou. 2023. Bridging the Gap between Relational OLTP and Graph-based OLAP. In 2023 USENIX Annual Technical Conference (USENIX ATC 23). USENIX Association. https:\/\/www.usenix.org\/conference\/atc23\/ presentation\/shen"},{"key":"e_1_2_2_94_1","doi-asserted-by":"publisher","DOI":"10.1145\/3639282"},{"key":"e_1_2_2_95_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2006.11.093"},{"key":"e_1_2_2_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2723732"},{"key":"e_1_2_2_97_1","doi-asserted-by":"publisher","DOI":"10.14778\/3574245.3574270"},{"key":"e_1_2_2_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522713"},{"key":"e_1_2_2_99_1","doi-asserted-by":"publisher","DOI":"10.1145\/3183713.3196895"},{"key":"e_1_2_2_100_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064037"},{"key":"e_1_2_2_101_1","doi-asserted-by":"publisher","DOI":"10.1145\/3380787.3393675"},{"key":"e_1_2_2_102_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389718"},{"key":"e_1_2_2_103_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData52589.2021.9671836"},{"key":"e_1_2_2_104_1","doi-asserted-by":"publisher","unstructured":"Brian Wheatman and Helen Xu. 2018. Packed Compressed Sparse Row: A Dynamic Graph Representation. In 2018 IEEE High Performance extreme Computing Conference (HPEC). 1--7. doi:10.1109\/HPEC.2018.8547566","DOI":"10.1109\/HPEC.2018.8547566"},{"key":"e_1_2_2_105_1","doi-asserted-by":"publisher","DOI":"10.14778\/3611540.3611614"},{"key":"e_1_2_2_106_1","doi-asserted-by":"publisher","DOI":"10.14778\/3067421.3067427"},{"key":"e_1_2_2_107_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882935"},{"key":"e_1_2_2_108_1","volume-title":"Fast Databases with Fast Durability and Recovery Through Multicore Parallelism. In 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14)","author":"Zheng Wenting","year":"2014","unstructured":"Wenting Zheng, Stephen Tu, Eddie Kohler, and Barbara Liskov. 2014. Fast Databases with Fast Durability and Recovery Through Multicore Parallelism. In 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14). USENIX Association, Broomfield, CO, 465--477. https:\/\/www.usenix.org\/conference\/osdi14\/technicalsessions\/ presentation\/zheng_wenting"},{"key":"e_1_2_2_109_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2017.2762298"},{"key":"e_1_2_2_110_1","volume-title":"GTX: A Write-Optimized Latch-free Graph Data System with Transactional Support -- Extended Version. arXiv:2405.01418 [cs.DB] https:\/\/arxiv.org\/abs\/2405.01418","author":"Zhou Libin","year":"2025","unstructured":"Libin Zhou, Lu Xing, Yeasir Rayhan, and Walid. G. Aref. 2025. GTX: A Write-Optimized Latch-free Graph Data System with Transactional Support -- Extended Version. arXiv:2405.01418 [cs.DB] https:\/\/arxiv.org\/abs\/2405.01418"},{"key":"e_1_2_2_111_1","doi-asserted-by":"publisher","DOI":"10.14778\/3384345.3384351"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725305","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3725305","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T18:57:21Z","timestamp":1774983441000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3725305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,17]]},"references-count":111,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6,17]]}},"alternative-id":["10.1145\/3725305"],"URL":"https:\/\/doi.org\/10.1145\/3725305","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,6,17]]}}}