Automating Fine Concurrency Control in Object-Oriented Databases
Carmelo Malta, Jos\'e Martinez (LINA)

TL;DR
This paper introduces an automated concurrency control scheme for object-oriented databases that determines method commutativity at compile-time, enhancing parallelism and simplifying recovery without adding overhead.
Contribution
It presents a novel approach that automatically determines method commutativity, improving parallelism and recovery in object-oriented databases compared to prior methods.
Findings
Automatic compile-time determination of method commutativity
Efficient run-time checking of method compatibility
Unified scheme subsuming relational and object-oriented concurrency controls
Abstract
Several propositions were done to provide adapted concurrency control to object-oriented databases. However, most of these proposals miss the fact that considering solely read and write access modes on instances may lead to less parallelism than in relational databases! This paper cope with that issue, and advantages are numerous: (1) commutativity of methods is determined a priori and automatically by the compiler, without measurable overhead, (2) run-time checking of commutativity is as efficient as for compatibility, (3) inverse operations need not be specified for recovery, (4) this scheme does not preclude more sophisticated approaches, and, last but not least, (5) relational and object-oriented concurrency control schemes with read and write access modes are subsumed under this proposition.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
