Magic sets revisited
From MaRDI portal
Recommendations
Cites work
- 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
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- 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
(11)- Graph traversal and top-down evaluation of logic queries
- Binding propagation beyond the reach of rule/goal graphs
- 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?)
- Commutativity and its role in the processing of linear recursion
- On the bottom-up evaluation of recursive queries
- Decomposition of magic rewriting
- Argument reduction by factoring
- Efficient evaluation of generalized left-linear recursive queries with multivalue binding sets
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)