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)
Cautious transaction schedulers with admission control
ACM Transactions on Database Systems (TODS)
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Serializability theory for replicated databases
Journal of Computer and System Sciences
Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Database concurrency control using data flow graphs
ACM Transactions on Database Systems (TODS)
Semantics based transaction management techniques for replicated data
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
The Performance of Flow Graph Locking
IEEE Transactions on Software Engineering
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Update Transport: A New Technique for Update Synchronization in Replicated Database Systems
IEEE Transactions on Software Engineering
A practical approach to replication of abstract data objects
A practical approach to replication of abstract data objects
A Majority consensus approach to concurrency control for multiple copy databases
ACM Transactions on Database Systems (TODS)
Fail-stop processors: an approach to designing fault-tolerant computing systems
ACM Transactions on Computer Systems (TOCS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
IEEE Transactions on Software Engineering
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
| Hi-index | 0.00 |
Regplicated data management systems adopt the 1-copy serializability criteria for processing transactions. In order to achieve this goal, many approaches, rely on obtaining votes from other sites, for processing update requests. In this paper, a technique for generation of precedence graphs for each transaction execution is proposed. The transaction data flow graph approach is a fully distributed approach. The proposed technique, is free from deadlocks, and avoids resubmission of transactions.