Abstract

Data replication is often used in distributed database applications to improve database availability and performance. Replicated database must be periodically refreshed using update propagation strategies. The concept of freshness is used to measure the deviation between replica copies. In this paper, we analyze the different methods to control the view divergence of data freshness for clients in replicated database systems whose facilitating or administrative roles are equal. The methods, mentioned in this paper, provide data to clients with freshness specified by them when updates are initially accepted by any of the replicas, and then, asynchronously propagated among the replicas. To provide data with statistically defined freshness, we select multiple replicas using a distributed algorithm and centralized algorithm so that they receive all updates issued up to a specified time before the present time. We compared the view divergence control of both methods in terms of controlled data freshness, time, message, and computation complexity. The comparison showed that distributed method achieves a great improvement in data freshness compared with centralized method.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.