Bridging the Gap between Relational OLTP and Graph-based OLAP

Authors: 

Sijie Shen, Institute of Parallel and Distributed Systems, Shanghai Jiao Tong University and Alibaba Group; Zihang Yao and Lin Shi, Institute of Parallel and Distributed Systems, Shanghai Jiao Tong University; Lei Wang, Longbin Lai, Qian Tao, and Li Su, Alibaba Group; Rong Chen, Institute of Parallel and Distributed Systems, Shanghai Jiao Tong University and Shanghai AI Laboratory; Wenyuan Yu, Alibaba Group; Haibo Chen and Binyu Zang, Institute of Parallel and Distributed Systems, Shanghai Jiao Tong University; Jingren Zhou, Alibaba Group

Abstract: 

Recently, many applications have required the ability to perform dynamic graph analytical processing (GAP) tasks on the datasets generated by relational OLTP in real time. To meet the two key requirements of performance and freshness, this paper presents GART, an in-memory system that extends hybrid transactional/analytical processing (HTAP) systems to support GAP, resulting in hybrid transactional and graph analytical processing (HTGAP). GART fulfills two unique goals that are not encountered by HTAP systems. First, to adapt to rich workloads flexibility, GART proposes transparent data model conversion by graph extraction interfaces, which define rules for relational-graph mapping. Second, to ensure GAP performance, GART proposes an efficient dynamic graph storage with good locality that stems from key insights into HTGAP workloads, including (1) an efficient and mutable compressed sparse row (CSR) representation to guarantee the locality of edge scan, (2) a coarse-grained multi-version concurrency control (MVCC) scheme to reduce the temporal and spatial overhead of versioning, and (3) a flexible property storage to efficiently run different GAP workloads. Evaluations show that GART performs several orders of magnitude better than existing solutions in terms of freshness or performance. Meanwhile, for GAP workloads on the LDBC SNB dataset, GART outperforms the state-of-the-art general-purpose dynamic graph storage (i.e., LiveGraph) by up to 4.4×.

USENIX ATC '23 Open Access Sponsored by
King Abdullah University of Science and Technology (KAUST)

Open Access Media

USENIX is committed to Open Access to the research presented at our events. Papers and proceedings are freely available to everyone once the event begins. Any video, audio, and/or slides that are posted after the event are also free and open to everyone. Support USENIX and our commitment to Open Access.

This content is available to:

BibTeX
@inproceedings {288760,
author = {Sijie Shen and Zihang Yao and Lin Shi and Lei Wang and Longbin Lai and Qian Tao and Li Su and Rong Chen and Wenyuan Yu and Haibo Chen and Binyu Zang and Jingren Zhou},
title = {Bridging the Gap between Relational {OLTP} and Graph-based {OLAP}},
booktitle = {2023 USENIX Annual Technical Conference (USENIX ATC 23)},
year = {2023},
isbn = {978-1-939133-35-9},
address = {Boston, MA},
pages = {181--196},
url = {https://www.usenix.org/conference/atc23/presentation/shen},
publisher = {USENIX Association},
month = jul
}

Presentation Video