Maintaining views incrementally
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
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
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
Efficient view maintenance at data warehouses
SIGMOD '97 Proceedings of the 1997 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
Query processing for distributed databases using generalized semi-joins
SIGMOD '82 Proceedings of the 1982 ACM SIGMOD international conference on Management of data
Posse: A Framework for optimizing incremental view maintenance at data warehouses
Posse: A Framework for optimizing incremental view maintenance at data warehouses
On the Importance of Tuning in Incremental View Maintenance: An Experience Case Study
DaWaK 2000 Proceedings of the Second International Conference on Data Warehousing and Knowledge Discovery
Self-maintainable Data Warehouse Views Using Differential Files
DEXA '02 Proceedings of the 13th International Conference on Database and Expert Systems Applications
| Hi-index | 0.00 |
We propose the Posse framework for optimizing incremental view maintenance at data warehouses. To this end, we show how for a particular method of consistent probing it is possible to have the power of SQL view queries with multiset semantics, and at the same time have available a spectrum of concurrency from none at all as in previously proposed solutions to the maximum concurrency obtained by issuing all probes in parallel. We then show how optimization of the probing process can be used to select various degrees of concurrency for the desired tradeoffs of concurrency against processing cost and message size.