Transactions and consistency in distributed database systems
ACM Transactions on Database Systems (TODS)
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Reliability mechanisms for SDD-1: a system for distributed databases
ACM Transactions on Database Systems (TODS)
The serializability of concurrent database updates
Journal of the ACM (JACM)
Reaching Agreement in the Presence of Faults
Journal of the ACM (JACM)
Recovery Techniques for Database Systems
ACM Computing Surveys (CSUR)
Concurrency Control in Distributed Database Systems
ACM Computing Surveys (CSUR)
The notions of consistency and predicate locks in a database system
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A recovery algorithm for a distributed database system
PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Notes on Data Base Operating Systems
Operating Systems, An Advanced Course
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A distributed transaction processing protocol based on majority consensus
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
A quorum-consensus replication method for abstract data types
ACM Transactions on Computer Systems (TOCS)
Low cost management of replicated data in fault-tolerant distributed systems
ACM Transactions on Computer Systems (TOCS)
Comparing how atomicity mechanisms support replication
ACM SIGOPS Operating Systems Review
Availability in partitioned replicated databases
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A turnable protocol for symmetric surveillance in distributed systems
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
Concurrency versus availability: atomicity mechanisms for replicated data
ACM Transactions on Computer Systems (TOCS)
Specifying graceful degradation in distributed systems
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
The group paradigm for concurrency control
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
A Pessimistic Consistency Control Algorithm for Replicated Files Which Achieves High Availability
IEEE Transactions on Software Engineering
Viewstamped Replication: A New Primary Copy Method to Support Highly-Available Distributed Systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Maintaining availability in partitioned replicated databases
ACM Transactions on Database Systems (TODS)
Concurrency and availability as dual properties of replicated atomic data
Journal of the ACM (JACM)
Apologizing versus asking permission: optimistic concurrency control for abstract data types
ACM Transactions on Database Systems (TODS)
Efficient availability mechanisms in distributed database systems
CIKM '93 Proceedings of the second international conference on Information and knowledge management
IEEE Transactions on Software Engineering
Independent Recovery in Large-Scale Distributed Systems
IEEE Transactions on Software Engineering
Comparing how atomicity mechanisms support replication
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Simplifying distributed database systems design by using a broadcast network
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Recovering from Multiple Process Failures in the Time Warp Mechanism
IEEE Transactions on Computers
A New Quorum-Based Scheme for Managing Replicated Data in Distributed Systems
IEEE Transactions on Computers
The Group Paradigm for Concurrency Control Protocols
IEEE Transactions on Knowledge and Data Engineering
Storage Efficient Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
VELOS: A New Approach for Efficiently Achieving High Availability in Partitioned Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Broadcast Protocols for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Specifying Graceful Degradation
IEEE Transactions on Parallel and Distributed Systems
A Nonblocking Quorum Consensus Protocol for Replicated Data
IEEE Transactions on Parallel and Distributed Systems
Multiclass Replicated Data Management: Exploiting Replication to Improve Efficiency
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Knowledge and Data Engineering
Efficient Execution of Read-Only Transactions in Replicated Multiversion Databases
IEEE Transactions on Knowledge and Data Engineering
Reducing Storage for Quorum Consensus Algorithms
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
Dynamic Data Distribution (D3) in a Shared-Nothing Multiprocessor Data Store
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
Quorum-Based Protocol for Locking Replicas of Objects
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Optimistic replication in HOPE
CASCON '92 Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2
Replication for web hosting systems
ACM Computing Surveys (CSUR)
Replication for web hosting systems
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Efficient Updates in Highly Available Distributed Random Access Memory
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
A near optimal approach to quality of service data replication scheduling
WSC '04 Proceedings of the 36th conference on Winter simulation
An integrated approach to recovery and high availability in an updatable, distributed data warehouse
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Automating service quality with TOMCAD (Tradeoff Model with Capacity and Demand)
Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE)
Maintaining and checking parity in highly available Scalable Distributed Data Structures
Journal of Systems and Software
Making cloud intermediate data fault-tolerant
Proceedings of the 1st ACM symposium on Cloud computing
Quorum based distributed conflict resolution algorithm for bounded capacity resources
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
An extendible hashing based recovery method in a shared-nothing spatial database cluster
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
Cluster recovery for fault tolerance of spatial database cluster in sensor networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
Energy-aware passive replication of processes
Journal of Mobile Multimedia
Hi-index | 0.01 |
A replicated database is a distributed database in which some data items are stored redundantly at multiple sites. The main goal is to improve system reliability. By storing critical data at multiple sites, the system can operate even though some sites have failed. However, few distributed database systems support replicated data, because it is difficult to manage as sites fail and recover. A replicated data algorithm has two parts. One is a discipline for reading and writing data item copies. The other is a concurrency control algorithm for synchronizing those operations. The read-write discipline ensures that if one transaction writes logical data item ×, and another transaction reads or writes x, there is some physical manifestation of that logical conflict. The concurrency control algorithm synchronizes physical conflicts; it knows nothing about logical conflicts. In a correct replicated data algorithm, the physical manifestation of conflicts must be strong enough so that synchronizing physical conflicts is sufficient for correctness. This paper presents a theory for proving the correctness of algorithms that manage replicated data. The theory is an extension of serializability theory. We apply it to three replicated data algorithms: Gifford's “quorum consensus” algorithm, Eager and Sevcik's “missing writes” algorithm, and Computer Corporation of America's “available copies” algorithm.