GTX:具备事务支持的写优化无闩锁图数据系统——扩展版
GTX: A Write-Optimized Latch-free Graph Data System with Transactional Support -- Extended Version
AI总结:
针对现有图系统因顶点级锁竞争导致写操作性能下降的问题,提出基于无闩锁存储与自适应增量链锁协议的GTX系统,在不损失读性能的前提下大幅提升写密集型事务吞吐量。
摘要:
本文介绍了GTX,一款独立的内存型写优化图数据系统,专攻结构与图属性更新,同时通过ACID事务支持并发读取与图分析任务。当前的图系统虽致力于在保障事务语义的同时支持并发读写,但面对真实世界中同一顶点和边上存在时间局部性的更新操作时,会因以顶点为中心的锁竞争导致性能下降。GTX在精心设计的无闩锁图存储之上,采用自适应增量链锁协议,既消除了顶点级锁竞争,又能适配真实工作负载,同时维持对图邻接表存储的顺序访问。GTX的事务还进一步支持缓存友好的块级并发控制,以及协作式组提交与垃圾回收机制。这些特性的组合确保了高更新吞吐量,并提供低延迟的图分析能力。实验评估表明,GTX不仅不会牺牲读密集型分析工作负载的性能,拥有与现有前沿系统相当的竞争力,还具备出色的读写事务吞吐量。在写密集型事务工作负载下,GTX的事务吞吐量最高可达性能最优的现有前沿系统的11倍。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。