A Performance Comparison of Optimistic versus Conservative Strategies during Partition Failures in Distributed Databases
Susan B. Davidson, Mark M. Winkler
Journal of Management Information Systems · 1987 · Volume 4 · Issue 2
DOI: 10.1080/07421222.1987.11517796
Abstract
Two strategies for processing transactions during partition failures in distributed databases are reviewed: the optimistic protocol and conservative class conflict graph analysis. Both use graph techniques for detecting and resolving conflicts, although one is “optimistic,” detecting and resolving conflict after the failure is repaired, while the other is “conservative,” detecting and preventing potential conflicts when the failure occurs. A simulation comparing the two approaches with respect to the cost of missed opportunity, the cost of repair, and overhead cost is presented, along with sample results. The optimistic protocol generally minimizes missed opportunity, while conservative class conflict graph analysis requires less overhead and no repair. The applicability of these approaches to fractured networks involving more than two partitions is also discussed.
Keywords
Distributed database system, network partitioning, optimistic protocol, conservative conflict graph analysis
Enable JavaScript for citation tools and additional paper interactions.