Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Using semantic knowledge for transaction processing in a distributed database
ACM Transactions on Database Systems (TODS)
Multilevel atomicity—a new correctness criterion for database concurrency control
ACM Transactions on Database Systems (TODS)
On semantic issues connected with incomplete information 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)
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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
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
Merging Partitioned Databases
An optimistic protocol for partitioned distributed database systems
An optimistic protocol for partitioned distributed database systems
Combinatorial Algorithms: Theory and Practice
Combinatorial Algorithms: Theory and Practice
Consistency in a partitioned network: a survey
ACM Computing Surveys (CSUR)
Limitations on database availability when networks partition
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Site optimal termination protocols for a distributed database under network partitioning
ACM SIGOPS Operating Systems Review
Dynamic quorum adjustment for partitioned data
ACM Transactions on Database Systems (TODS)
ACM Transactions on Information Systems (TOIS)
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Update propagation in Bakunin data networks
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Single-Site and Distributed Optimistic Protocols for Concurrency Control
IEEE Transactions on Software Engineering
Commitment in a partitioned distributed database
SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Achieving High Availability in Distributed Databases
IEEE Transactions on Software Engineering
A Dynamic Voting Scheme in Distributed Systems
IEEE Transactions on Software Engineering
Partition detection and optimistic commit for dynamically reconfigurable distributed databases
SIGSMALL '88 Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES
Node autonomy in distributed systems
DPDS '88 Proceedings of the first international symposium on Databases in parallel and distributed systems
Using histories to implement atomic objects
ACM Transactions on Computer Systems (TOCS)
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Coda: A Highly Available File System for a Distributed Workstation Environment
IEEE Transactions on Computers
CHI '90 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Update Transport: A New Technique for Update Synchronization in Replicated Database Systems
IEEE Transactions on Software Engineering
Disconnected operation in the Coda file system
SOSP '91 Proceedings of the thirteenth ACM symposium on Operating systems principles
Design of optimal distributed file systems: a framework for research
ACM SIGOPS Operating Systems Review
Disconnected operation in the Coda File System
ACM Transactions on Computer Systems (TOCS)
A non-blocking transaction data flow graph based approach for replicated data
ACM SIGOPS Operating Systems Review
A Fault-Tolerant Algorithm for Replicated Data Management
IEEE Transactions on Parallel and Distributed Systems
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Voting class — an approach to achieving high availability for replicated data
DPDS '90 Proceedings of the second international symposium on Databases in parallel and distributed systems
Site optimal termination protocols for a distributed database under network partitioning
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Effects of distributed database modeling on evaluation of transaction rollbacks
WSC' 90 Proceedings of the 22nd conference on Winter simulation
Rewriting Histories: Recovering from Malicious Transactions
Distributed and Parallel Databases - Security of data and transaction processing
Optimal Allocation for Partially Replicated Database Systems on Ring Networks
IEEE Transactions on Knowledge and Data Engineering
Concurrency Control in Database Systems
IEEE Transactions on Knowledge and Data Engineering
Mobile Computing and Databases-A Survey
IEEE Transactions on Knowledge and Data Engineering
A Nonblocking Quorum Consensus Protocol for Replicated Data
IEEE Transactions on Parallel and Distributed Systems
Transaction Processing in an Asymmetric Mobile Environment
MDA '99 Proceedings of the First International Conference on Mobile Data Access
The Bancomat problem: an example of resource allocation in a partitionable asynchronous system
Theoretical Computer Science - Special issue: Distributed computing
Weakly consistent transactions in ROSS
CASCON '93 Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: distributed computing - Volume 2
Transaction-centric reconciliation in disconnected client-server databases
Mobile Networks and Applications
A reactive system architecture for building fault-tolerant distributed applications
Journal of Systems and Software
Abstractions for fault-tolerant global computing
Theoretical Computer Science - Special issue: Foundations of wide area network computing
The design and implementation of a self-healing database system
Journal of Intelligent Information Systems - Special issue: Database and applications security
Post-partition reconciliation protocols for maintaining consistency
Proceedings of the 2006 ACM symposium on Applied computing
Real-time data attack isolation for commercial database applications
Journal of Network and Computer Applications
Experience with disconnected operation in a mobile computing environment
MLCS Mobile & Location-Independent Computing Symposium on Mobile & Location-Independent Computing Symposium
A solution for fault tolerance in replicated database systems
International Journal of Computational Science and Engineering
A real-time intrusion prevention system for commercial enterprise databases and file systems
AIKED'05 Proceedings of the 4th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering Data Bases
A real-time intrusion prevention system for commercial enterprise databases
SEPADS'05 Proceedings of the 4th WSEAS International Conference on Software Engineering, Parallel & Distributed Systems
A real-time intrusion prevention system for commercial enterprise databases and file systems
MMACTEE'08 Proceedings of the 10th WSEAS International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering
| Hi-index | 0.00 |
A protocol for transaction processing during partition failures is presented which guarantees mutual consistency between copies of data-items after repair is completed. The protocol is “optimistic” in that transactions are processed without restrictions during failure; conflicts are then detected at repair time using a precedence graph, and are resolved by backing out transactions according to some backout strategy. The resulting database state then corresponds to a serial execution of some subset of transactions run during the failure. Results from simulation and probabilistic modeling show that the optimistic protocol is a reasonable alternative in many cases. Conditions under which the protocol performs well are noted, and suggestions are made as to how performance can be improved. In particular, a backout strategy is presented which takes into account individual transaction costs and attempts to minimize total backout cost. Although the problem of choosing transactions to minimize total backout cost is, in general, NP-complete, the backout strategy is efficient and produces very good results.