Efficient bottom-up computation of queries on stratified databases

DOI10.1016/0743-1066(91)90030-SMaRDI QIDQ3988800zbMATH OpenOpenAlexFDO

Authors Isaac Balbin, G. S. Port, Kotagiri Ramamohanarao, K. N. Meenakshi

Publication date 28 June 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(91)90030-s

zbMATH Keywords

deductive databasesmagic sets

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• Top-down query processing in indefinite stratified databases
• Efficient top-down computation of queries under the well-founded semantics
• On the bottom-up evaluation of recursive queries
• Parallel bottom-up processing of datalog queries
• Efficient Approximations of Conjunctive Queries

Cited in

(12)

• Graph traversal and top-down evaluation of logic queries
• A transformation system for deductive database modules with perfect model semantics
• OLDTNF-based evaluation method for handling recursive queries in deductive databases
• Bottom-up evaluation of datalog with negation
• Upside-down meta-interpretation of the model elimination theorem-proving procedure for deduction and abduction
• Magic sets revisited
• Counting and topological order
• scientific article; zbMATH DE number 993474 (Why is no real title available?)
• Extended magic for negation: efficient demand-driven evaluation of stratified Datalog with precise complexity guarantees
• Enhancing magic sets with an application to ontological reasoning
• Bottom-up evaluation and query optimization of well-founded models
• The generalized supplementary magic-sets transformation for stratified Datalog

This page was built for publication: Efficient bottom-up computation of queries on stratified databases

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