Magic sets revisited

DOI10.1007/BF02943154MaRDI QIDQ1368187zbMATH OpenFDO

Authors Yangjun Chen

Publication date 16 February 1998

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

zbMATH Keywords

linear recursionmagic-set method

Mathematics Subject Classification ID

Database theory (68P15)

Recommendations

• On the bottom-up evaluation of recursive queries
• An analysis of magic sets and related optimization strategies for logic queries
• On the power of magic
• Magic templates: a spellbinding approach to logic programs

Cites work

• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• Comparison of methods for logic-query implementation
• Depth-First Search and Linear Graph Algorithms
• Efficient bottom-up computation of queries on stratified databases
• Graphic representation of linear recursive rules
• Implementation of logical query languages for databases
• On compiling queries in recursive first-order databases
• On the power of magic
• Towards an algebraic theory of recursion
• Worst case analysis of two heuristics for the set partitioning problem

Cited in

(8)

• Characterization and processing of simple prefixed-chain recursion
• Counting and topological order
• Compilation and evaluation of linear mutual recursions
• scientific article; zbMATH DE number 5542483 (Why is no real title available?)
• Binding propagation beyond the reach of rule/goal graphs
• Efficient evaluation of generalized left-linear recursive queries with multivalue binding sets
• Graph traversal and top-down evaluation of logic queries
• Commutativity and its role in the processing of linear recursion

Describes a project that uses

Uses Software

• Datalog

This page was built for publication: Magic sets revisited

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