Abstract
In this paper, new replica control algorithms, called the enhanced tree quorum (ETQ) algorithm and the multiple tree quorum (MTQ) algorithm, are proposed to manage replicated data in distributed database systems. These algorithms provide high availability for read and write operations by imposing a logical structure of modified tree with a backup root on data copies in ETQ, and multiple trees on data copies in MTQ. With ETQ algorithm, a read operation is limited to a data copy in the best case, and a write operation is allowed as long as one of the roots and the majority of the children of each node selected are available in the tree. With MTQ algorithm, a read operation is limited to a couple of data copies, and a write operation is allowed as long as the majority of the roots of the trees and the majority of the children of each node selected are available. Compared to other algorithms, ETQ and MTQ require lower message cost for an operation, while providing higher availability.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
