scientific article; zbMATH DE number 993474

DOI10.1002/(SICI)1098-111X(199703)12:3%3C203::AID-INT3%3E3.0.CO;2-TMaRDI QIDQ3125846zbMATH OpenFDO

Authors Yangjun Chen

Publication date 18 November 1997

Full work available at URL https://doi.org/10.1002/(SICI)1098-111X(199703)12:3%3C203::AID-INT3%3E3.0.CO;2-T

zbMATH Keywords

bottom-up query evaluationstratified databases

Mathematics Subject Classification ID

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

Recommendations

• Efficient bottom-up computation of queries on stratified databases
• The generalized supplementary magic-sets transformation for stratified Datalog
• An analysis of magic sets and related optimization strategies for logic queries
• Modular stratification and magic sets for Datalog programs with negation

Cited in

(7)

• Graph traversal and top-down evaluation of logic queries
• OLDTNF-based evaluation method for handling recursive queries in deductive databases
• Counting and topological order
• Magic semi-joins
• On the graph traversal method for evaluating linear binary-chain programs
• Incorporating stratified negation into query-subquery nets for evaluating queries to stratified deductive databases
• The generalized supplementary magic-sets transformation for stratified Datalog

This page was built for publication:

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