Incremental maintenance of views with duplicates
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
An algebraic approach to static analysis of active database rules
ACM Transactions on Database Systems (TODS)
Transaction Repair for Integrity Enforcement
IEEE Transactions on Knowledge and Data Engineering
A Dynamic Approach to Termination Analysis for Active Database Rules
CL '00 Proceedings of the First International Conference on Computational Logic
An Abstract Interpretation Framework for Termination Analysis of Active Rules
DBPL '99 Revised Papers from the 7th International Workshop on Database Programming Languages: Research Issues in Structured and Semistructured Database Programming
Optimising Active Database Rules by Partial Evaluation and Abstract Interpretation
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Efficient View Maintenance Using Version Numbers
DEXA '01 Proceedings of the 12th International Conference on Database and Expert Systems Applications
Self-maintainable Data Warehouse Views Using Differential Files
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
Monotonic complements for independent data warehouses
The VLDB Journal — The International Journal on Very Large Data Bases
Incremental recomputation in local languages
Information and Computation
Incremental Maintenance of Nested Relational Views
IDEAS '99 Proceedings of the 1999 International Symposium on Database Engineering & Applications
K2/Kleisli and GUS: experiments in integrated access to genomic data sources
IBM Systems Journal - Deep computing for the life sciences
Reducing the cost of accessing relations in incremental view maintenance
Decision Support Systems
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Generating incremental implementations of object-set queries
GPCE '08 Proceedings of the 7th international conference on Generative programming and component engineering
An efficient method for maintaining data cubes incrementally
Information Sciences: an International Journal
Caching and Materialization for Web Databases
Foundations and Trends in Databases
Runtime checking for program verification
RV'07 Proceedings of the 7th international conference on Runtime verification
Optimized incremental ETL jobs for maintaining data warehouses
Proceedings of the Fourteenth International Database Engineering & Applications Symposium
Destabilizers and independence of XML updates
Proceedings of the VLDB Endowment
Exploitation of referential integrity constraints for efficient update of data warehouse views
BNCOD'05 Proceedings of the 22nd British National conference on Databases: enterprise, Skills and Innovation
Efficient update of data warehouse views with generalised referential integrity differential files
BNCOD'06 Proceedings of the 23rd British National Conference on Databases, conference on Flexible and Efficient Information Handling
| Hi-index | 0.00 |
In [1], Qian and Wiederhold presented an algorithm for the incremental recomputation of relational algebra expressions that was claimed to preserve a certain minimality condition. This condition guarantees that the incremental change sets do not contain any unnecessary tuples; so, redundant computations are not performed. We show that, in fact, their algorithm violates this condition. We present an improved algorithm that does preserve this notion of minimality.