Incremental and decremental evaluation of transitive closure by first- order queries

DOI10.1006/inco.1995.1102zbMath0835.68031OpenAlexW2009489912MaRDI QIDQ1898482

Jianwen Su, Guozhu Dong

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

zbMATH Keywords

transitive closurefirst-order queries

Mathematics Subject Classification ID

Database theory (68P15) Graph theory (including graph drawing) in computer science (68R10)

Related Items (12)

SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS ⋮ Maintaining transitive closure in first order after node-set and edge-set deletions ⋮ Reachability is in DynFO ⋮ Incremental Event Calculus for Run-Time Reasoning ⋮ Dyn-FO: A parallel, dynamic complexity class ⋮ The dynamic complexity of transitive closure is in DynTC\(^{0}\). ⋮ Incremental recomputation in local languages. ⋮ Dynamic Complexity of the Dyck Reachability ⋮ Irrelevant updates and self-maintainability in transitive closure database views ⋮ Arity bounds in first-order incremental evaluation and definition of polynomial time database queries ⋮ Maintenance of datalog materialisations revisited ⋮ Local properties of query languages

This page was built for publication: Incremental and decremental evaluation of transitive closure by first- order queries