Nonrecursive incremental evaluation of Datalog queries

DOI10.1007/BF01530820zbMath0855.68026OpenAlexW2011697756MaRDI QIDQ1924723

Guozhu Dong, Jianwen Su, Rodney W. Topor

Publication date: 20 October 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01530820

zbMATH Keywords

nonrecursive Datalog

Mathematics Subject Classification ID

Database theory (68P15)

Related Items (13)

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 ⋮ Modular materialisation of Datalog programs ⋮ Incremental Event Calculus for Run-Time Reasoning ⋮ The dynamic complexity of acyclic hypergraph homomorphisms ⋮ Unnamed Item ⋮ A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption ⋮ Incremental classification of description logics ontologies ⋮ Unnamed Item ⋮ Arity bounds in first-order incremental evaluation and definition of polynomial time database queries ⋮ Maintenance of datalog materialisations revisited ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices ⋮ Dynamic complexity of expansion

Uses Software

• Datalog

Cites Work

• Unnamed Item
• A time bound on the materialization of some recursively defined views
• On-line computation of transitive closures of graphs
• Amortized efficiency of a path retrieval data structure
• Undecidable boundedness problems for datalog programs
• Integrity constraint checking in stratified databases
• Partial evaluation in logic programming
• The Semantics of Predicate Logic as a Programming Language

This page was built for publication: Nonrecursive incremental evaluation of Datalog queries