Incremental and decremental evaluation of transitive closure by first- order queries
From MaRDI portal
Publication:1898482
DOI10.1006/INCO.1995.1102zbMATH Open0835.68031OpenAlexW2009489912MaRDI QIDQ1898482FDOQ1898482
Authors: Guozhu Dong, Jianwen Su 
Publication date: 17 September 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1995.1102
Recommendations
- scientific article; zbMATH DE number 1953132
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases
- Nonrecursive incremental evaluation of Datalog queries
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- An experimental study of dynamic algorithms for transitive closure
- An experimental study of algorithms for fully dynamic transitive closure
Cited In (12)
- SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS
- The dynamic complexity of transitive closure is in DynTC\(^{0}\).
- Dynamic complexity of the Dyck reachability
- Local properties of query languages
- Reachability is in DynFO
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
- Maintaining transitive closure in first order after node-set and edge-set deletions
- Maintenance of datalog materialisations revisited
- Irrelevant updates and self-maintainability in transitive closure database views
- Incremental recomputation in local languages.
- Incremental Event Calculus for Run-Time Reasoning
- Dyn-FO: A parallel, dynamic complexity class
This page was built for publication: Incremental and decremental evaluation of transitive closure by first- order queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898482)
