Optimism and consistency in partitioned distributed database systems
ACM Transactions on Database Systems (TODS)
Site optimal termination protocols for a distributed database under network partitioning
ACM SIGOPS Operating Systems Review
Site optimal termination protocols for a distributed database under network partitioning
Proceedings of the fourth annual ACM symposium on Principles of distributed computing
On merging partitioned databases
SIGMOD '83 Proceedings of the 1983 ACM SIGMOD international conference on Management of data
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 probabilistic model is presented and compared with the simulations.