paperbot · PL 论文追踪

全部论文 待读 收藏

P2 CommonGraph: Graph Analytics on Evolving Data

CommonGraph:面向演化数据的图分析
ASPLOS Proceedings of the 28th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 22023匹配度 1/10 · 该论文研究演化图上的图分析查询与增量流式计算系统,属于图计算/运行时优化方向,与用户画像中的静态分析、LLM/Agent、浮点程序分析和贝叶斯程序分析均无直接关联。引用 32 inbox
Mahbod Afarin, Chao Gao, Shafiur Rahman, Nael Abu-Ghazaleh, Rajiv Gupta
crossref: 2026-09-12

AI 速览

一句话:提出 CommonGraph,用公共图将删除转为添加并共享增量计算,加速演化图上的查询处理。

在演化图上,同一查询常需在长时间窗口内的多个快照上执行,以追踪属性变化。独立执行会重复计算多个快照共有的子计算;传统流式方法从最早快照开始增量更新,但删除操作代价高且快照间存在顺序依赖,因此也不高效。CommonGraph 先找出所有快照共有的公共图,将删除转为添加;在公共图上计算查询后,只需向目标快照添加缺失边并增量更新结果。它允许需要相同添加的快照共享公共边,并打破传统流式的顺序依赖,创造额外并行机会。作者通过扩展 KickStarter 流式框架实现该方案,并优化边添加处理,避免昂贵的原地图变异、降低流式开销并直接复用共享边。在多个基准上,CommonGraph 相比 KickStarter 取得 1.38x–8.17x 的性能提升。

问题
演化图上的图分析需在多个快照上重复执行同一查询;独立执行重复公共子计算,流式处理又受高删除代价与快照间顺序依赖限制,效率低。
方法
CommonGraph 构造所有快照共有的公共图,将删除转为添加;在公共图上计算查询后,按快照添加缺失边并增量更新结果;共享公共添加,打破顺序依赖以增加并行性,并扩展 KickStarter 框架优化边添加与流式开销。
评估
在多个图分析基准上,与 KickStarter 流式框架对比,CommonGraph 获得 1.38x–8.17x 的性能提升。
原文摘要(Abstract)

We consider the problem of graph analytics on evolving graphs (i.e., graphs that change over time). In this scenario, a query typically needs to be applied to different snapshots of the graph over an extended time window, for example to track the evolution of a property over time. Solving a query independently on multiple snapshots is inefficient due to repeated execution of subcomputation common to multiple snapshots. At the same time, we show that using streaming, where we start from the earliest snapshot and stream the changes to the graph incrementally updating the query results one snapshot at a time is also inefficient. We propose CommonGraph, an approach for efficient processing of queries on evolving graphs. We first observe that deletion operations are significantly more expensive than addition operations for many graph queries (those that are monotonic). CommonGraph converts all deletions to additions by finding a common graph that exists across all snapshots. After computing the query on this graph, to reach any snapshot, we simply need to add the missing edges and incrementally update the query results. CommonGraph also allows sharing of common additions among snapshots that require them, and breaks the sequential dependency inherent in the traditional streaming approach where snapshots are processed in sequence, enabling additional opportunities for parallelism. We incorporate the CommonGraph approach by extending the KickStarter streaming framework. We implement optimizations that enable efficient handling of edge additions without resorting to expensive in place graph mutations, significantly reducing the streaming overhead, and enabling direct reuse of shared edges among different snapshots. CommonGraph achieves 1.38x-8.17x improvement in performance over Kickstarter across multiple benchmarks.

链接与引用

DOI 原文 · PDF(开放获取) ·

BibTeX
@inproceedings{paperbot10010,
  title = {CommonGraph: Graph Analytics on Evolving Data},
  author = {Mahbod Afarin and Chao Gao and Shafiur Rahman and Nael Abu-Ghazaleh and Rajiv Gupta},
  booktitle = {ASPLOS},
  year = {2023},
  doi = {10.1145/3575693.3575713}
}