Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 37 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 10 tok/s Pro
GPT-5 High 15 tok/s Pro
GPT-4o 84 tok/s Pro
Kimi K2 198 tok/s Pro
GPT OSS 120B 448 tok/s Pro
Claude Sonnet 4 31 tok/s Pro
2000 character limit reached

GTX: A Transactional Graph Data System For HTAP Workloads (2405.01448v1)

Published 2 May 2024 in cs.DB

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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (12)
  1. [n.d.]. OpenMP. https://www.openmp.org/
  2. A critique of ANSI SQL isolation levels. SIGMOD Rec. 24, 2 (may 1995), 1–10. https://doi.org/10.1145/568271.223785
  3. Mammoths Are Slow: The Overlooked Transactions of Graph Data. ([n. d.]).
  4. Dean De Leo. [n.d.]. graphlog. https://github.com/whatsthecraic/graphlog
  5. Dean De Leo and Peter Boncz. 2021. Teseo and the Analysis of Structural Dynamic Graphs. 14, 6 (feb 2021), 1053–1066. https://doi.org/10.14778/3447689.3447708
  6. Sortledton: A Universal, Transactional Graph Data Structure. Proc. VLDB Endow. 15, 6 (feb 2022), 1173–1186. https://doi.org/10.14778/3514061.3514065
  7. LDBC Graphalytics: A Benchmark for Large-Scale Graph Analysis on Parallel and Distributed Platforms. 9, 13 (2016), 12.
  8. Jérôme Kunegis. [n.d.]. The KONECT Project. http://konect.cc/
  9. ByteGraph: A High-Performance Distributed Graph Database in ByteDance. Proc. VLDB Endow. 15, 12 (2022).
  10. Performant Almost-Latch-Free Data Structures Using Epoch Protection. In Data Management on New Hardware (DaMoN’22). Article 1, 10 pages.
  11. An Empirical Evaluation of In-Memory Multi-Version Concurrency Control. Proc. VLDB Endow. 10, 7 (2017). https://doi.org/10.14778/3067421.3067427
  12. LiveGraph: A Transactional Graph Storage System with Purely Sequential Adjacency List Scans. 13, 7 (mar 2020), 1020–1034.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

X Twitter Logo Streamline Icon: https://streamlinehq.com