# G-Tran: Making Distributed Graph Transactions Fast

arXiv: https://arxiv.org/abs/2105.04449 · HTML: https://mlsanity.com/paper/2105.04449/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 10 May 2021.

## Built on by (most cited first, 1 of 1)

- [Graph Neural Networks on Graph Databases](https://mlsanity.com/paper/2411.11375/) (2024)

## Abstract (arXiv)

Graph transaction processing raises many unique challenges such as random data access due to the irregularity of graph structures, low throughput and high abort rate due to the relatively large read/write sets in graph transactions. To address these challenges, we present G-Tran -- an RDMA-enabled distributed in-memory graph database with serializable and snapshot isolation support. First, we propose a graph-native data store to achieve good data locality and fast data access for transactional updates and queries. Second, G-Tran adopts a fully decentralized architecture that leverages RDMA to process distributed transactions with the MPP model, which can achieve high performance by utilizing all computing resources. In addition, we propose a new MV-OCC implementation with two optimizations to address the issue of large read/write sets in graph transactions. Extensive experiments show that G-Tran achieves competitive performance compared with other popular graph databases on benchmark workloads.