Nonrecursive incremental evaluation of Datalog queries

DOI10.1007/BF01530820MaRDI QIDQ1924723zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Efficient evaluation for a subset of recursive queries
• Datalog and recursive query processing
• Incremental recomputation in local languages.
• Datalog extensions for database queries and updates

Cites work

• A time bound on the materialization of some recursively defined views
• Amortized efficiency of a path retrieval data structure
• scientific article; zbMATH DE number 432747 (Why is no real title available?)
• Integrity constraint checking in stratified databases
• On-line computation of transitive closures of graphs
• Partial evaluation in logic programming
• The Semantics of Predicate Logic as a Programming Language
• Undecidable boundedness problems for datalog programs

Cited in

(25)

• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Arity bounds in first-order incremental evaluation and definition of polynomial time database queries
• Incremental recomputation in local languages.
• Incremental and decremental evaluation of transitive closure by first- order queries
• Dynamic complexity of expansion
• Modular materialisation of Datalog programs
• Memory-saving evaluation plans for Datalog
• Maintenance of datalog materialisations revisited
• The dynamic complexity of acyclic hypergraph homomorphisms
• Incremental Tabling for Query-Driven Propagation of Logic Program Updates
• Maintaining transitive closure in first order after node-set and edge-set deletions
• Answering UCQs under updates and in the presence of integrity constraints
• A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
• scientific article; zbMATH DE number 1304706 (Why is no real title available?)
• scientific article; zbMATH DE number 1149474 (Why is no real title available?)
• scientific article; zbMATH DE number 2080398 (Why is no real title available?)
• SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS
• scientific article; zbMATH DE number 1737514 (Why is no real title available?)
• Reachability and distances under multiple changes
• Incremental Event Calculus for Run-Time Reasoning
• A strategy for dynamic programs: start over and muddle through
• Fixing incremental computation. Derivatives of fixpoints, and the recursive semantics of Datalog
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints
• The parallel dynamic complexity of the abelian Cayley group membership problem
• Incremental classification of description logics ontologies

Describes a project that uses

Uses Software

• Datalog

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924723)