This paper provides unified protocols of concurrency control and recovery in distributed object-based databases by using two unified conflict notions: Preservation and weak preservation. The two conflict relations provide the solutions to (i) the low-level heterogeneity of different recovery mechanisms and/or object models, and (ii) the correct schedules from both concurrency control and recovery points of view. In particular, preservation can be used for accepting serializable and strict (SR-ST) and/or serializable and avoiding cascading aborts (SR-ACA) schedules, whereas weak preservation can be used for accepting serializable and recoverable (SR-RC) schedules. It is also shown that the unified protocols are general enough for object-based databases in addition to the classical read/write databases.
ASJC Scopus subject areas
- Computer Science(all)