Efficient bottom-up computation of queries on stratified databases
From MaRDI portal
Publication:3988800
DOI10.1016/0743-1066(91)90030-SzbMath0764.68012OpenAlexW2050571300MaRDI QIDQ3988800
Isaac Balbin, K. N. Meenakshi, Kotagiri Ramamohanarao, G. S. Port
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
Related Items (11)
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 ⋮ Graph traversal and top-down evaluation of logic queries ⋮ Enhancing Magic Sets with an Application to Ontological Reasoning ⋮ Unnamed Item ⋮ Bottom-up evaluation and query optimization of well-founded models ⋮ The generalized supplementary magic-sets transformation for stratified Datalog ⋮ A transformation system for deductive database modules with perfect model semantics ⋮ OLDTNF-based evaluation method for handling recursive queries in deductive databases
This page was built for publication: Efficient bottom-up computation of queries on stratified databases
