Open travelbeeee opened 2 years ago
In a distributed database system, a transaction could execute its operations at multiple sites. Since atomicity requires every distributed transaction to be atomic, the transaction must have the same fate (commit or abort) at every site. In case of network partitioning, sites are partitioned and the partitions may not be able to communicate with each other. This is where a quorum-based technique comes in. The fundamental idea is that a transaction is executed if the majority of sites vote to execute it.
However, this kind of multicast tree may be inefficient in multi-channel CRAHNs, since the dynamically changing links and network topology can result in frequent update of the multicast tree, which incurs unacceptable cost.
참고) https://velog.io/@yunhongmin/SSTable-data-storage
참고) https://d2.naver.com/helloworld/749531
W + R > N
W + R = N
[Chapter 06] 키-값 저장소 설계