On compiling queries in recursive first-order databases
From MaRDI portal
Publication:3766890
DOI10.1145/2422.2423zbMath0629.68095OpenAlexW1970637119MaRDI QIDQ3766890
Lawrence J. Henschen, Shamim Naqvi
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2422.2423
relational databaseresolutionlogic programmingprogram synthesisrecursively defined relationslogic program compilationfirst-order databasefunction-free first-order theory
Abstract data types; algebraic specification (68Q65) Information storage and retrieval of data (68P20)
Related Items
Controlling recursive inference, One-sided recursions, The generalized counting method for recursive logic queries, Magic sets revisited, Data independent recursion in deductive databases, Answering atomic queries in indefinite deductive databases, Recursive query processing in predicate-goal graph, A graph-based decomposition approach for recursive query processing, Logic programming with sets, A counting algorithm for a cyclic binary query, Paraconsistent disjunctive deductive databases, The parallel complexity of single rule logic programs, On the graph traversal method for evaluating linear binary-chain programs, Characterization and processing of simple prefixed-chain recursion, A time bound on the materialization of some recursively defined views, Compilation and evaluation of linear mutual recursions, Recursive query processing: The power of logic, A relational approach to logic programming: The extended Alexander method, Bounds in the propagation of selection into logic programs, Translation of logic programs into functional fixpoint equations, Fixpoint strategies for deductive databases, Magic semi-joins