On compiling queries in recursive first-order databases

DOI10.1145/2422.2423MaRDI QIDQ3766890zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

first-order databasefunction-free first-order theorylogic program compilationlogic programmingprogram synthesisrecursively defined relationsrelational databaseresolution

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Abstract data types; algebraic specification (68Q65)

Recommendations

• Implementation of logical query languages for databases
• scientific article; zbMATH DE number 3982568
• scientific article; zbMATH DE number 4092827
• scientific article; zbMATH DE number 4106311
• Data independent recursion in deductive databases

Cited in

(35)

• Controlling recursive inference
• The generalized counting method for recursive logic queries
• Data independent recursion in deductive databases
• A counting algorithm for a cyclic binary query
• Paraconsistent disjunctive deductive databases
• The parallel complexity of single rule logic programs
• Characterization and processing of simple prefixed-chain recursion
• Recursive query processing: The power of logic
• A relational approach to logic programming: The extended Alexander method
• First-order queries on databases embedded in an infinite structure
• Magic sets revisited
• Average-case complexity for the execution of recursive definitions on relational databases (paper no 50-95 accepted for publication in ACTA INFORMATICA)
• Compilation and evaluation of linear mutual recursions
• 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
• Structural recursion as a query language on lists and ordered trees
• One-sided recursions
• Answering atomic queries in indefinite deductive databases
• First-Order Queries over One Unary Function
• Implementation of logical query languages for databases
• On first-order-logic databases
• scientific article; zbMATH DE number 4043316 (Why is no real title available?)
• scientific article; zbMATH DE number 4092827 (Why is no real title available?)
• scientific article; zbMATH DE number 4106311 (Why is no real title available?)
• scientific article; zbMATH DE number 1953141 (Why is no real title available?)
• scientific article; zbMATH DE number 2080398 (Why is no real title available?)
• Additive first-order queries
• Recursive query processing in predicate-goal graph
• A time bound on the materialization of some recursively defined views
• On the graph traversal method for evaluating linear binary-chain programs
• A graph-based decomposition approach for recursive query processing
• Substitution-based compilation of extended rules in deductive databases
• Logic programming with sets

This page was built for publication: On compiling queries in recursive first-order databases

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