Incremental Graph Computations: Doable and Undoable

Author:

Fan Wenfei1,Tian Chao2ORCID

Affiliation:

1. University of Edinburgh & Shenzhen Institute of Computing Sciences & Beihang University, Edinburgh, UK

2. Institute of Software, Chinese Academy of Sciences, Beijing, China

Abstract

The incremental problem for a class \( {\mathcal {Q}} \) of graph queries aims to compute, given a query \( Q \in {\mathcal {Q}} \) , graph G , answers Q ( G ) to Q in G and updates ΔG to G as input, changes ΔO to output Q ( G ) such that Q ( GΔG ) = Q ( G )⊕ ΔO . It is called bounded if its cost can be expressed as a polynomial function in the sizes of Q , ΔG and ΔO , which reduces the computations on possibly big G to small ΔG and ΔO . No matter how desirable, however, our first results are negative: For common graph queries such as traversal, connectivity, keyword search, pattern matching, and maximum cardinality matching, their incremental problems are unbounded. In light of the negative results, we propose two characterizations for the effectiveness of incremental graph computation: (a) localizable , if its cost is decided by small neighbors of nodes in ΔG instead of the entire G ; and (b) bounded relative to a batch graph algorithm \( {\mathcal {T}} \) , if the cost is determined by the sizes of ΔG and changes to the affected area that is necessarily checked by any algorithms that incrementalize \( {\mathcal {T}} \) . We show that the incremental computations above are either localizable or relatively bounded by providing corresponding incremental algorithms. That is, we can either reduce the incremental computations on big graphs to small data, or incrementalize existing batch graph algorithms by minimizing unnecessary recomputation. Using real-life and synthetic data, we experimentally verify the effectiveness of our incremental algorithms.

Funder

ERC

Royal Society Wolfson Research Merit Award

Publisher

Association for Computing Machinery (ACM)

Subject

Information Systems

Reference75 articles.

1. DBpedia Association. 2014. DBpedia. Retrieved from http://wiki.dbpedia.org/Downloads2014.

2. Retrieved from http://snap.stanford.edu/data/index.html 2016 SNAP

3. Retrieved from 2020 GraphScope

4. Retrieved from 2020 Size of Wikipedia

5. Retrieved from 2021 MovieLens

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

1. Capturing More Associations by Referencing External Graphs;Proceedings of the VLDB Endowment;2024-02

2. A Distributed Algorithm for Identifying Strongly Connected Components on Incremental Graphs;2023 IEEE 35th International Symposium on Computer Architecture and High Performance Computing (SBAC-PAD);2023-10-17

3. On Querying Connected Components in Large Temporal Graphs;Proceedings of the ACM on Management of Data;2023-06-13

4. Maximal D-Truss Search in Dynamic Directed Graphs;Proceedings of the VLDB Endowment;2023-05

5. Edge Coloring on Dynamic Graphs;Database Systems for Advanced Applications;2023

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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