Efficient evaluation of right-, left-, and multi-linear rules
SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query evaluation in recursive databases: bottom-up and top-down reconciled
Data & Knowledge Engineering
Modular acyclicity and tail recursion in logic programs
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Journal of Logic Programming
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Magic-sets transformation in nonrecursive systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimizations of bottom-up evaluation with non-ground terms: extended abstract
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
XSB as an efficient deductive database engine
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
The VLDB Journal — The International Journal on Very Large Data Bases - Prototypes of deductive database systems
On a Declarative Semantics for Web Queries
DOOD '97 Proceedings of the 5th International Conference on Deductive and Object-Oriented Databases
Right-, left- and multi-linear rule transformations that maintain context information
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
W3QS: A Query System for the World-Wide Web
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
ADBIS '95 Proceedings of the Second International Workshop on Advances in Databases and Information Systems
Improving the Alternating Fixpoint: The Transformation Approach
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
A variant of earley deduction with partial evaluation
RR'13 Proceedings of the 7th international conference on Web Reasoning and Rule Systems
| Hi-index | 0.00 |
The magic set technique is a standard technique for query evaluation in deductive databases, and its variants are also used in modern commercial database systems like DB2. Numerous improvements of the basic technique have been proposed. However, each of these optimizations makes the transformation more complicated, and combining them in a single system is at least difficult. In this paper, a new transformation is introduced, which is based on partial evaluation of a bottom-up meta-interpreter for SLD-resolution. In spite of its simplicity, this technique gives us a whole bunch of optimizations for free: For instance, it contains a tail recursion optimization, it transforms non-recursive into non-recursive programs, it can pass arbitary conditions on the parameters to called predicates, and it saves the join necessary to get subquery results back into the calling context. In this way, it helps to integrate many of the previous efforts. The usefulness of these optimizations is illustrated with example programs querying the World Wide Web.