Sortledton

Author:

Fuchs Per1,Margan Domagoj2,Giceva Jana1

Affiliation:

1. TU Munich

2. Imperial College London

Abstract

Despite the wide adoption of graph processing across many different application domains, there is no underlying data structure that can serve a variety of graph workloads (analytics, traversals, and pattern matching) on dynamic graphs with transactional updates. In this paper, we present Sortledton, a universal graph data structure that addresses the open problem by being carefully optimizing for the most relevant data access patterns used by graph computation kernels. It can support millions of transactional updates per second, while providing competitive performance (1.22x on average) for the most common graph workloads to the best-known baseline for static graphs - CSR. With this, we improve the ingestion throughput over state-of-the-art dynamic graph data structures, while supporting a wider range of graph computations under transactional guarantees, with a much simpler design and significantly smaller memory footprint (2.1x that of CSR).

Publisher

Association for Computing Machinery (ACM)

Subject

General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development

Reference57 articles.

1. EmptyHeaded

2. Renzo Angles János Benjamin Antal Alex Averbuch Peter A. Boncz Orri Erling Andrey Gubichev Vlad Haprian Moritz Kaufmann Josep Lluís Larriba-Pey Norbert Martínez-Bazan József Marton Marcus Paradies Minh-Duc Pham Arnau Prat-Pérez Mirko Spasic Benjamin A. Steer Gábor Szárnyas and Jack Waudby. 2020. The LDBC Social Network Benchmark. CoRR abs/2001.02299 (2020). arXiv:2001.02299 http://arxiv.org/abs/2001.02299 Renzo Angles János Benjamin Antal Alex Averbuch Peter A. Boncz Orri Erling Andrey Gubichev Vlad Haprian Moritz Kaufmann Josep Lluís Larriba-Pey Norbert Martínez-Bazan József Marton Marcus Paradies Minh-Duc Pham Arnau Prat-Pérez Mirko Spasic Benjamin A. Steer Gábor Szárnyas and Jack Waudby. 2020. The LDBC Social Network Benchmark. CoRR abs/2001.02299 (2020). arXiv:2001.02299 http://arxiv.org/abs/2001.02299

3. G-CORE

4. LinkBench

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. LSGraph: A Locality-centric High-performance Streaming Graph Engine;Proceedings of the Nineteenth European Conference on Computer Systems;2024-04-22

2. TgStore: An Efficient Storage System for Large Time-Evolving Graphs;IEEE Transactions on Big Data;2024-04

3. Spruce: a Fast yet Space-saving Structure for Dynamic Graph Storage;Proceedings of the ACM on Management of Data;2024-03-12

4. Mammoths are Slow: The Overlooked Transactions of Graph Data;Proceedings of the VLDB Endowment;2023-12

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3