Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Commutativity-Based Concurrency Control for Abstract Data Types
IEEE Transactions on Computers
Data caching issues in an information retrieval system
ACM Transactions on Database Systems (TODS)
Replica control in distributed systems: as asynchronous approach
SIGMOD '91 Proceedings of the 1991 ACM SIGMOD international conference on Management of data
Semantics-based concurrency control: beyond commutativity
ACM Transactions on Database Systems (TODS)
Tolerating bounded inconsistency for increasing concurrency in database systems
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)
Consistency and orderability: semantics-based correctness criteria for databases
ACM Transactions on Database Systems (TODS)
Bounded ignorance: a technique for increasing concurrency in a replicated system
ACM Transactions on Database Systems (TODS)
Managing mutual awareness in collaborative virtual environments
VRST '94 Proceedings of the conference on Virtual reality software and technology
Virtual Society: extending the WWW to support a multi-user interactive shared 3D environment
VRML '95 Proceedings of the first symposium on Virtual reality modeling language
Efficient optimistic concurrency control using loosely synchronized clocks
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Temporal notions of synchronization and consistency in Beehive
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Timed consistency for shared distributed objects
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Improving Performance in Replicated Databases through Relaxed Coherency
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Efficient Numerical Error Bounding for Replicated Network Services
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Asynchronous consistency restoration under epsilon serializability
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
A scalable technique for implementing multiple consistency levels for distributed objects
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Design and Evaluation of MiMaze, a Multi-Player Game on the Internet
ICMCS '98 Proceedings of the IEEE International Conference on Multimedia Computing and Systems
Maintaining consistency of data in mobile distributed environments
ICDCS '95 Proceedings of the 15th International Conference on Distributed Computing Systems
Design and evaluation of a continuous consistency model for replicated services
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
The costs and limits of availability for replicated services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Efficient Data Distribution in a Web Server Farm
IEEE Internet Computing
The costs and limits of availability for replicated services
ACM Transactions on Computer Systems (TOCS)
Hi-index | 0.00 |
Abstract: Replication is a key approach to scaling wide-area applications. However, the overhead associated with large-scale replication quickly becomes prohibitive across wide-area networks. One effective approach to addressing this limitation is to allow applications to dynamically trade reduced consistency for increased performance and availability. Although extensive study has been performed on relaxed consistency models in traditional replicated databases, none of the models can simultaneously achieve the following two typically conflicting requirements imposed by wide-area applications: generality (capturing application-specific consistency semantics) and practicality (enabling efficient application-independent consistency protocols to be designed and providing natural ways to express application semantics). In this paper, we propose a conit-based continuous consistency model designed to simultaneously achieve generality and practicality. Our conit theory provides generality, where application-specific consistency requirements are exported as conits. Practicality is achieved by using a simple, spanning set of metrics for conit consistency and by using a per-write weight specification. We demonstrate the generality of our model through representative wide-area applications and by showing that a number of existing models can be expressed as instances of our model. Our efficient, application-independent consistency protocols and prototype implementation verify its practicality.