Implementation of logical query languages for databases
ACM Transactions on Database Systems (TODS)
Magic sets and other strange ways to implement logic programs (extended abstract)
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Filtering data flow in deductive databases
Proceedings on International conference on database theory
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Optimization of nested SQL queries revisited
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
Performance evaluation of data intensive logic programs
Foundations of deductive databases and logic programming
Bottom-up beats top-down for datalog
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming and databases
Logic programming and databases
The magic of duplicates and aggregates
Proceedings of the sixteenth international conference on Very large databases
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Magic templates: a spellbinding approach to logic programs
Journal of Logic Programming
Constraints and redundancy in datalog
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query optimization in deductive and relational databases
Query optimization in deductive and relational databases
Equivalence, query-reachability and satisfiability in Datalog extensions
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Indexing for data models with constraints and classes (extended abstract)
PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Compiling query constraints (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Implementation of magic-sets in a relational database system
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
An algorithm for ordering subgoals in NAIL?
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On optimizing an SQL-like nested query
ACM Transactions on Database Systems (TODS)
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Data Structures and Algorithms
Data Structures and Algorithms
Starburst Mid-Flight: As the Dust Clears
IEEE Transactions on Knowledge and Data Engineering
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Query Optimization by Predicate Move-Around
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Deductive database languages: problems and solutions
ACM Computing Surveys (CSUR)
Static analysis in datalog extensions
Journal of the ACM (JACM)
Dynamic Constraints Derivation and Maintenance in the Teradata RDBMS
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Experimenting with recursive queries in database and logic programming systems
Theory and Practice of Logic Programming
Enhancing a DLP System for Advanced Database Applications
RR '08 Proceedings of the 2nd International Conference on Web Reasoning and Rule Systems
Adding efficient data management to logic programming systems
ISMIS'06 Proceedings of the 16th international conference on Foundations of Intelligent Systems
| Hi-index | 0.00 |
Much recent work has focused on the bottom-up evaluation of Datalog programs [Bancilhon and Ramakrishnan 1988]. One approach, called magic-sets, is based on rewriting a logic program so that bottom-up fixpoint evaluation of the program avoids generation of irrelevant facts [Bancilhon et al. 1986; Beeri and Ramakrishnan 1987; Ramakrishnan 1991]. It was widely believed for some time that the principal application of the magic-sets technique is to restrict computation in recursive queries using equijoin predicates. We extend the magic-sets transformation to use predicates other than equality (X10, for example) in restricting computation. The resulting ground magic-sets transformation is an important step in developing an extended magic-sets transformation that has practical utility in “real” relational databases, not only for recursive queries, but for nonrecursive queries as well [Mumick et al. 1990b; Mumick 1991].