Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Distributed algorithms for dynamic replication of data
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Providing high availability using lazy replication
ACM Transactions on Computer Systems (TOCS)
ACM Transactions on Database Systems (TODS)
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Implementing Lazy Database Updates for an Object Database System
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Correctness of Lazy Database Updates for Object Database Systems
Proceedings of the Sixth International Workshop on Persistent Object Systems
Workshop on Dependable Middleware-Based Systems
DSN '02 Proceedings of the 2002 International Conference on Dependable Systems and Networks
A Suite of Database Replication Protocols based on Group Communication Primitives
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Soft constraints and heuristic constraint correction in entity-relationship modelling
Proceedings of the 2nd international conference on Semantics in databases
Extending wide-area replication support with mobility and improved recovery
ISSADS'05 Proceedings of the 5th international conference on Advanced Distributed Systems
| Hi-index | 0.00 |
We describe a family of three replication protocols, each of which can operate in three different modes of consistency. The protocols are tailored to satisfy the availability demands of interconnected databases that have a high degree of data locality. The protocols accomplish a grade of transaction completion which does not compromise availability, and ensure the consistency of replicas also if a transaction needs to be aborted. Flexibility of query answering is understood as optimizing the tradeoff between consistency and availability, i.e., between correctness and timeliness of query answering. This is achieved by choosing an appropriate protocol alternative, and changing the consistency mode of operation during the session, as appropriate for a given transaction.