Replica Update Propagation Using Demand-Based Tree for Weak Consistency in the Grid Database

• Published in: 멀티미디어학회논문지 Vol. 9; no. 12; pp. 1542 - 1551
• Main Authors: Ge, Ruixuan, Jang, Yong-Il, Park, Soon-Young, Bae, Hae-Young
• Format: Journal Article
• Language: Korean
• Published: 2006
• Subjects: Demand-Based Tree; Grid Database; Replica Update Propagation
• ISSN: 1229-7771; 2384-0102

In the Grid Database, some replicas will have more requests from the clients than others. A fast consistency algorithm has been presented to satisfy the high demand nodes in a shorter period of time. But it has poor performance in multiple regions of high demand for forming the island of locally consistent replicas. Then, a leader election method is proposed, whereas it needs much additional cost for periodic leader election, information storage, and message passing, Also, false leader can be created. In this paper, we propose a tree-based algorithm for replica update propagation. Leader replicas with high demand are considered as the roots of trees which are interconnected. All the other replicas are sorted and considered as nodes of the trees. Once an update occurs at any replica, it need be transmitted to the leader replicas first. Every node that receives the update propagates it to its children in the tree. The update propagation is optimized by cost reduction for fixed propagation schedule. And it is also flexible for the dynamic model in which the demand conditions change with time.