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
Merging Partitioned Databases
An optimistic protocol for partitioned distributed database systems
An optimistic protocol for partitioned distributed database systems
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Partition detection and optimistic commit for dynamically reconfigurable distributed databases
SIGSMALL '88 Proceedings of the 1988 ACM SIGSMALL/PC symposium on ACTES
Dynamic voting algorithms for maintaining the consistency of a replicated database
ACM Transactions on Database Systems (TODS)
Effects of distributed database modeling on evaluation of transaction rollbacks
WSC' 90 Proceedings of the 22nd conference on Winter simulation
| Hi-index | 0.00 |
Partitioning of a distributed data base requires either that update activity be restricted or that a strategy for conflict resolution and partition merging be used once communication is restored. The graph-theoretic approach used by Davidson follows the latter approach and can be used to show that finding an optimum solution to the general problem is NP-complete. We give several methods of reducing the size of the graphs involved. Two open subproblems are shown to be NP-complete, while an extension of a known polynomial-time subproblem is given. Simulation results are used to study both the amount of compression achieved by the graph reduction techniques and their effects on heuristics for the problem. In addition, some modifications are made to existing heuristics to improve their performance. A simple probabilistic model is developed and compared to the simulation results.