Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Research problems in data warehousing
CIKM '95 Proceedings of the fourth international conference on Information and knowledge management
View maintenance in a warehousing environment
SIGMOD '95 Proceedings of the 1995 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
Building the data warehouse (2nd ed.)
Building the data warehouse (2nd ed.)
Algorithms for deferred view maintenance
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Maintenance of data cubes and summary tables in a warehouse
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Efficient view maintenance at data warehouses
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Shrinking the warehouse update Window
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
How to roll a join: asynchronous incremental view maintenance
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Materialized view selection and maintenance using multi-query optimization
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
The Strobe algorithms for multi-source warehouse consistency
DIS '96 Proceedings of the fourth international conference on on Parallel and distributed information systems
A heuristic approach to attribute partitioning
SIGMOD '79 Proceedings of the 1979 ACM SIGMOD international conference on Management of data
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Deriving Production Rules for Incremental View Maintenance
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
ATTRIBUTE PARTITIONING IN A SELF-ADAPTIVE RELATIONAL DATA BASE SYSTEM
ATTRIBUTE PARTITIONING IN A SELF-ADAPTIVE RELATIONAL DATA BASE SYSTEM
MEDWRAP: Consistent View Maintenance over Distributed Multi-relation Sources
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
MOVIE: an incremental maintenance system for materialized object views
Data & Knowledge Engineering
Optimizing the incremental maintenance of multiple join views
Proceedings of the 8th ACM international workshop on Data warehousing and OLAP
Optimizing Cyclic Join View Maintenance over Distributed Data Sources
IEEE Transactions on Knowledge and Data Engineering
Maintaining large update batches by restructuring and grouping
Information Systems
Caching and incrementalisation in the java query language
Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Monitoring data dependencies in concurrent process execution through delta-enabled grid services
International Journal of Web and Grid Services
Nectar: automatic management of data and computation in datacenters
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
Higher-Order reactive programming with incremental lists
ECOOP'13 Proceedings of the 27th European conference on Object-Oriented Programming
Hi-index | 0.00 |
In the data warehouse environment, the concept of a materialized view is nowadays common and important in an objective of efficiently supporting OLAP query processing. Materialized views are generally derived from select-project-join of several base relations. These materialized views need to be updated when the base relations change. Since the propagation of updates to the views may impose a significant overhead, it is very important to update the warehouse views efficiently. Though various view maintenance strategies have been discussed so far, they typically require too much access to base relations, resulting in the performance degradation.In this paper we propose an efficient incremental view maintenance strategy called delta propagation that can minimize the total size of base relations accessed by analyzing the properties of base relations. We first define the delta expression and a delta propagation tree which are core concepts of the strategy. Then, a dynamic programming algorithm that can find the optimal delta expression are proposed. We also present various experimental results that show the usefulness and efficiency of the strategy.