Incremental Graph Computations: Doable and Undoable
The incremental problem for a class of graph queries aims to compute, given a query , 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(Gg•δG) = Q(G)g•δO. It is called bounded if its cost can be expressed as a polynomial function in the sizes of Q, δ...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |