Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Implementing recoverable requests using queues
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
New TPC benchmarks for decision support and web commerce
ACM SIGMOD Record
On computing correlated aggregates over continual data streams
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
Models and issues in data stream systems
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Transaction support for indexed summary views
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Locking protocols for materialized aggregate join views
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Content-based filtering for efficient online materialized view maintenance
Proceedings of the 17th ACM conference on Information and knowledge management
Transaction reordering with application to synchronized scans
Proceedings of the 17th ACM conference on Information and knowledge management
Transaction reordering with application to synchronized scans
Proceedings of the ACM 11th international workshop on Data warehousing and OLAP
Scheduling strategies for efficient ETL execution
Information Systems
| Hi-index | 0.00 |
With the increasing popularity of operational data warehousing, the ability to load data quickly and continuously into an RDBMS is becoming more and more important. However, in the presence of materialized join views, loading data concurrently into multiple base relations of the same materialized join view can cause a severe deadlock problem. To solve this problem, we propose reordering the data to be loaded so that at any time, for any materialized join view, data is only loaded into one of its base relations. Also, for load transactions on the relations that contain "aggregate" attributes, we propose using pre-aggregation to reduce the number of SQL statements in the load transactions. The advantages of our methods are demonstrated through experiments with a commercial parallel RDBMS.