Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Algorithms in C
On the dynamic shortest path problem
Journal of Information Processing
On-line computation of minimal and maximal length paths
Theoretical Computer Science
Dynamic algorithms for shortest paths in planar graphs
Theoretical Computer Science
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Dyn-FO (preliminary version): a parallel, dynamic complexity class
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Deriving incremental production rules for deductive data
Information Systems
Faster shortest-path algorithms for planar graphs
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Space-bounded FOIES (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Maintaining transitive closure in first order after node-set and edge-set deletions
Information Processing Letters
A data structure for arc insertion and regular path finding
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Incremental maintenance of recursive views using relational calculus/SQL
ACM SIGMOD Record
Bounded Incremental Computation
Bounded Incremental Computation
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
A faster and simpler fully dynamic transitive closure
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Maintaining Constrained Transitive Closure by Conjunctive Queries
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
Incremental Evaluation of Datalog Queries
ICDT '92 Proceedings of the 4th International Conference on Database Theory
First-order Definability over Constraint Databases
CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
A Method for Change Computation in Deductive Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
A new approach to dynamic all pairs shortest paths
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A fully dynamic reachability algorithm for directed graphs with an almost linear update time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Managing RBAC states with transitive relations
ASIACCS '07 Proceedings of the 2nd ACM symposium on Information, computer and communications security
Dominating sets in directed graphs
Information Sciences: an International Journal
ACM Transactions on Database Systems (TODS)
Scalable and efficient web services composition based on a relational database
Journal of Systems and Software
Pay-as-you-go maintenance of precomputed nearest neighbors in large graphs
Proceedings of the 21st ACM international conference on Information and knowledge management
| Hi-index | 0.00 |
Given a database, the view maintenance problem is concerned with the efficient computation of the new contents of a given view when updates to the database happen. We consider the view maintenance problem for the situation when the database contains a weighted graph and the view is either the transitive closure or the answer to the all-pairs shortest-distance problem (APSD). We give incremental algorithms for APSD, which support both edge insertions and deletions. For transitive closure, the algorithm is applicable to a more general class of graphs than those previously explored. Our algorithms use first-order queries, along with addition (+) and less-than (FO(+,O(n2) number of tuples, where n is the number of vertices, and have AC0 data complexity for integer weights. Since FO(+,