arrow
返回

TeGraph plus : Scalable Temporal Graph Processing Enabling Flexible Edge Modifications

delete2024-08-01
delete0
PRE
AI
C
Chengying Huan *
刘
刘勇超 (Yongchao Liu)
H
Heng Zhang
H
Hang Liu
S
Shiyang Chen
S
Shuaiwen Leon Song
Y
Yanjun Wu
DOI:10.1109/TPDS.2024.3393914delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Temporal graphs are widely used for time-critical applications, which enable the extraction of graph structural information with temporal features but cannot be efficiently supported by static graph computing systems. However, the current state-of-the-art solutions for temporal graph problems are not only ad-hoc and suboptimal, but they also exhibit poor scalability, particularly in terms of their inability to scale to evolving graphs with flexible edge modifications (including insertions and deletions) and diverse execution environments. In this article, we present two key observations. First, temporal path problems can be characterized as topological-optimum problems, which can be efficiently resolved using a universal single-scan execution model. Second, data redundancy in transformed temporal graphs can be mitigated by merging superfluous vertices. Building upon these fundamental insights, we propose TeGraph+, a versatile temporal graph computing engine that makes the following contributions: (1) a unified optimization strategy and execution model for temporal graph problems; (2) a novel graph transformation model with graph redundancy reduction strategy; (3) a spanning tree decomposition (STD) based distributed execution model which uses an efficient transformed graph decomposition strategy to partition the transformed graph into different spanning trees for distributed execution; (4) an efficient mixed imperative and lazy graph update strategy that offers support for evolving graphs with flexible edge modifications; (5) a general system framework with user-friendly APIs and the support of various execution environments, including in-memory, out-of-core, and distributed execution environments. Our extensive evaluation reveals that TeGraph+ can achieve up to 241x speedups over the state-of-the-art counterparts.
Keyword:
Time factors
Computational modeling
Scalability
Engines
Bandwidth
Heuristic algorithms
Data models
Graph algorithm
temporal graphs
parallel and distributed system

期刊

IEEE Transactions on Parallel and Distributed Systems 封面图
IEEE Transactions on Parallel and Distributed Systems
IF:
6
论文数:
5.2K
被引数:
1.1W

机构

T
tsinghua university
学者数:
11.9W
论文数: 10.0W
被引数: 137
I
institute of software, cas
学者数:
446
论文数: 388
被引数: 0
R
rutgers university new brunswick
学者数:
2.3W
论文数: 1.9W
被引数: 32
C
chinese academy of sciences
学者数:
56.7W
论文数: 45.0W
被引数: 704
学者 查看更多机构
引用论文

引用论文

Hollow Viscus Injury
err2009-10-01
err0
PREAI
errChristopher McStay; Anna Ringwelski; Philip Levy; Eric Legome
err分享
err收藏
err分享
err收藏
What is a blink? Classifying and characterizing blinks in eye openness signals
err2024-02-29
err0
errOAAI
errMarcus Nyström; Richard Andersson; Diederick C. Niehorster; Roy S. Hessels; Ignace T. C. Hooge
err分享
err收藏
Mitochondrial Quality Control Governed by Ubiquitin
err2020-04-24
err0
errOAAI
errSonia Ravanelli; Fabian den Brave; Thorsten Hoppe
err分享
err收藏
学者 查看更多内容