Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Concurrency and recovery in generalized search trees
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
Materialized views: techniques, implementations, and applications
Materialized views: techniques, implementations, and applications
Locking Primitives in a Database System
Journal of the ACM (JACM)
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
Transaction Processing: Concepts and Techniques
Transaction Processing: Concepts and Techniques
Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab, and Sub-Total
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
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
IEEE Transactions on Knowledge and Data Engineering
Locking protocols for materialized aggregate join views
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
| Hi-index | 0.00 |
Immediate materialized view maintenance with transactional consistency is highly desirable to support real-time decision making. Nevertheless, due to high deadlock rates, such maintenance can cause significant performance degradation in the database system. To increase concurrency during such maintenance, we previously proposed the V locking protocol for materialized aggregate join views and showed how to implement it on hash indices. In this paper, we address the thorny problem of implementing the V locking protocol on B-tree indices. We also formally prove that our techniques are both necessary and sufficient to ensure correctness (serializability).