Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
An algorithm for concurrency control and recovery in replicated distributed databases
ACM Transactions on Database Systems (TODS)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Low cost management of replicated data in fault-tolerant distributed systems
ACM Transactions on Computer Systems (TOCS)
Concurrency control algorithms and their performance in replicated database systems
Concurrency control algorithms and their performance in replicated database systems
Single-Site and Distributed Optimistic Protocols for Concurrency Control
IEEE Transactions on Software Engineering
Semantics based transaction management techniques for replicated data
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
A new symmetric ON multiple copy update algorithm and its performance evaluation
A new symmetric ON multiple copy update algorithm and its performance evaluation
VAXcluster: a closely-coupled distributed system
ACM Transactions on Computer Systems (TOCS)
Achieving robustness 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)
An efficient, fault-tolerant protocol for replicated data management
PODS '85 Proceedings of the fourth ACM SIGACT-SIGMOD symposium on Principles of database systems
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Implementation techniques for main memory database systems
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
System M: A Transaction Processing Testbed for Memory Resident Data
IEEE Transactions on Knowledge and Data Engineering
The Grid Protocol: A High Performance Scheme for Maintaining Replicated Data
Proceedings of the Sixth International Conference on Data Engineering
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
A principle for resilient sharing of distributed resources
ICSE '76 Proceedings of the 2nd international conference on Software engineering
Performance of update algorithms for replicated data in a distributed database.
Performance of update algorithms for replicated data in a distributed database.
A non-blocking transaction data flow graph based approach for replicated data
ACM SIGOPS Operating Systems Review
Automatic modeling of file system workloads using two-level arrival processes
ACM Transactions on Modeling and Computer Simulation (TOMACS)
A Nonblocking Transaction Data Flow Graph Based Protocol For Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Performance Modeling of Distributed and Replicated Databases
IEEE Transactions on Knowledge and Data Engineering
Improving Performance in Replicated Databases through Relaxed Coherency
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
| Hi-index | 0.00 |
A fully distributed approach to update synchronization is presented where each site completely executes every update. This approach has several features-higher resiliency to different kinds of failures, higher parallelism, improved response to user requests, and low communication overhead. A fully distributed algorithm for concurrency control obtained by rehashing a previously published semidistributed algorithm into the fully distributed model of update execution is presented. A performance model of replicated database systems is presented and used to study the performance of the proposed algorithm and its semidistributed version. The results of the performance study reveal that the proposed approach can substantially improve the performance at the cost of moderate input/output overhead.