{"title":"GTX: A Transactional Graph Data System For HTAP Workloads","authors":"Libin Zhou, Walid Aref","doi":"arxiv-2405.01448","DOIUrl":null,"url":null,"abstract":"Processing, managing, and analyzing dynamic graphs are the cornerstone in\nmultiple application domains including fraud detection, recommendation system,\ngraph neural network training, etc. This demo presents GTX, a latch-free\nwrite-optimized transactional graph data system that supports high throughput\nread-write transactions while maintaining competitive graph analytics. GTX has\na unique latch-free graph storage and a transaction and concurrency control\nprotocol for dynamic power-law graphs. GTX leverages atomic operations to\neliminate latches, proposes a delta-based multi-version storage, and designs a\nhybrid transaction commit protocol to reduce interference between concurrent\noperations. To further improve its throughput, we design a delta-chains index\nto support efficient edge lookups. GTX manages concurrency control at\ndelta-chain level, and provides adaptive concurrency according to the workload.\nReal-world graph access and updates exhibit temporal localities and hotspots.\nUnlike other transactional graph systems that experience significant\nperformance degradation, GTX is the only system that can adapt to temporal\nlocalities and hotspots in graph updates and maintain\nmillion-transactions-per-second throughput. GTX is prototyped as a graph\nlibrary and is evaluated using a graph library evaluation tool using real and\nsynthetic datasets.","PeriodicalId":501123,"journal":{"name":"arXiv - CS - Databases","volume":"32 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-05-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Databases","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2405.01448","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Processing, managing, and analyzing dynamic graphs are the cornerstone in
multiple application domains including fraud detection, recommendation system,
graph neural network training, etc. This demo presents GTX, a latch-free
write-optimized transactional graph data system that supports high throughput
read-write transactions while maintaining competitive graph analytics. GTX has
a unique latch-free graph storage and a transaction and concurrency control
protocol for dynamic power-law graphs. GTX leverages atomic operations to
eliminate latches, proposes a delta-based multi-version storage, and designs a
hybrid transaction commit protocol to reduce interference between concurrent
operations. To further improve its throughput, we design a delta-chains index
to support efficient edge lookups. GTX manages concurrency control at
delta-chain level, and provides adaptive concurrency according to the workload.
Real-world graph access and updates exhibit temporal localities and hotspots.
Unlike other transactional graph systems that experience significant
performance degradation, GTX is the only system that can adapt to temporal
localities and hotspots in graph updates and maintain
million-transactions-per-second throughput. GTX is prototyped as a graph
library and is evaluated using a graph library evaluation tool using real and
synthetic datasets.