Distributed databases principles and systems
Distributed databases principles and systems
Efficiently updating materialized views
SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Principles of distributed database systems
Principles of distributed database systems
An incremental access method for ViewCache: concept, algorithms, and cost analysis
ACM Transactions on Database Systems (TODS)
Incremental evaluation of rules and its relationship to parallelism
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Join processing in relational databases
ACM Computing Surveys (CSUR)
Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Incremental and decremental evaluation of transitive closure by first-order queries
Information and Computation
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
Materialized view maintenance and integrity constraint checking: trading space for time
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A framework for supporting data integration using the materialized and virtual approaches
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Database System Concepts
Incremental Recomputation of Active Relational Expressions
IEEE Transactions on Knowledge and Data Engineering
Data Integration using Self-Maintainable Views
EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Maintaining Materialized Views in Distributed Databases
Proceedings of the Fifth International Conference on Data Engineering
Currency-Based Updates to Distributed Materialized Views
Proceedings of the Sixth International Conference on Data Engineering
Incremental Evaluation of Datalog Queries
ICDT '92 Proceedings of the 4th International Conference on Database Theory
Data Warehouse Design and Maintenance through View Normalization
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
Maintaining views in object-relational databases
Knowledge and Information Systems
Hi-index | 0.00 |
The incremental view maintenance problem deals with the efficient updating of materialized views in response to updates to base relations. This paper considers the problem in a distributed database environment, with communication cost minimization as the primary objective. The views considered are defined based on the relational join operation. The approach is to use ’’yes‘‘/’’no‘‘ tags as auxiliary data on tuples in the base relations to indicate whether the tuples participate in joins. These tags will help avoid sending irrelevant data over the network and thus reduce the communication cost. Two basic view maintenance algorithms are proposed using the tags. In addition to reducing communication costs, an important feature of these two basic algorithms is that they derive the ’’exact change‘‘ to views without looking at the old views. This feature allows us to maintain certain aggregates on views without actually materializing the views themselves; this feature is useful in applications such as active databases where many conditions or constraints must be tested whenever updates occur, since a condition is true exactly when some corresponding view has nonzero number of tuples. The paper then combines the use of tags with the counting algorithm to derive a tagged counting algorithm that further reduces the communication cost. The paper illustrates the algorithms by examples and studies their performance via a statistical analysis. The illustrating examples and the performance analysis show that, under uniform distribution with reasonable join participation rates, the use of tags significantly improves the efficiency of view maintenance over similar algorithms without tags. The performance analysis also identifies the situations where a particular algorithm is superior to others. The use of tags for memoing values of subexpressions in a view definition is also explored in the paper.