Data independent recursion in deductive databases

DOI10.1016/0022-0000(89)90003-2zbMath0677.68108OpenAlexW2004862636MaRDI QIDQ1123651

Jeffrey F. Naughton

Publication date: 1989

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(89)90003-2

zbMATH Keywords

data independent recursiondeductive database systemsevaluation algorithms for recursive rules

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Information storage and retrieval of data (68P20)

Related Items (10)

PREDICATE BOUNDEDNESS OF LINEAR MONADIC DATALOG IS IN PSPACE ⋮ Controlling recursive inference ⋮ One-sided recursions ⋮ Can datalog be approximated? ⋮ Eliminating Recursion from Monadic Datalog Programs on Trees ⋮ Recursive query processing in predicate-goal graph ⋮ About boundedness for some datalog and DATALOGneg programs ⋮ On the equivalence of recursive and nonrecursive Datalog programs ⋮ Decidable containment of recursive queries ⋮ Unnamed Item

Cites Work

• Undecidable optimization problems for database logic programs
• Implementation of logical query languages for databases
• On compiling queries in recursive first-order databases
• Minimizing function-free recursive inference rules
• Equivalences Among Relational Expressions with the Union and Difference Operators
• Equivalences among Relational Expressions

This page was built for publication: Data independent recursion in deductive databases