Nonrecursive incremental evaluation of Datalog queries
From MaRDI portal
Publication:1924723
DOI10.1007/BF01530820zbMath0855.68026MaRDI 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)
68P15: Database theory
Related Items
SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-ary INPUT RELATIONS, Incremental classification of description logics ontologies, 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, A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption
Uses Software
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