A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Incremental Graph Computations

2017
*
Proceedings of the 2017 ACM International Conference on Management of Data - SIGMOD '17
*

The incremental problem for a class Q of graph queries aims to compute, given a query Q ∈ Q, graph G, output Q(G) and updates ∆G to G as input, changes ∆O to 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. It is to reduce 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 graph traversal, connectivity,

doi:10.1145/3035918.3035944
dblp:conf/sigmod/FanHT17
fatcat:ztfnkrpfkbatrp5wy7eepbhcmy