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
Alpha: An Extension of Relational Algebra to Express a Class of Recursive Queries
IEEE Transactions on Software Engineering
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
A theorem-proving approach to database integrity
Foundations of deductive databases and logic programming
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Efficient bottom-up computation of queries on stratified databases
Journal of Logic Programming
Magic-sets transformation in nonrecursive systems
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
The alternating fixpoint of logic programs with negation
PODS '89 Selected papers of the eighth 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
Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Algorithms for deferred view maintenance
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Supporting multiple view maintenance policies
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
How to roll a join: asynchronous incremental view maintenance
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Incremental maintenance of recursive views using relational calculus/SQL
ACM SIGMOD Record
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Using Partial Differencing for Efficient Monitoring of Deferred Complex Rule Conditions
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
Integrity Constraints Checking In Deductive Databases
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Deriving Production Rules for Incremental View Maintenance
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
A Method for Change Computation in Deductive Databases
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Soft stratification for magic set based query evaluation in deductive databases
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Incremental Evaluation of Sliding-Window Queries over Data Streams
IEEE Transactions on Knowledge and Data Engineering
A transformational framework for the automatic control of derived data
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Incremental view-based analysis of stock market data streams
IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
Optimized incremental ETL jobs for maintaining data warehouses
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
| Hi-index | 0.00 |
This paper is concerned with a transformation-based approach to update propagation in an extended version of Codd's relational algebra which allows for defining derived relations (even recursively). It is shown that the desired optimization effects of update propagation may be lost if no generalized selection pushing strategy is employed to the transformed algebra expressions. A possible solution is the application of the Magic Sets rewriting but this may lead to unstratifiability of the incremental expressions. For the efficient evaluation of Magic Sets transformed algebra expressions we propose to use the soft stratification approach because of the simplicity and efficiency of this technique.