Abstract
This paper presents a new scheme that enhances the availability of data in the full replicated distributed database systems. This scheme allaws to tolerate a new type of the partition of the network that the old previous schemes in the same type doesn’t allow. In addition, the update is based on a full distributed algorithm, i.e. every update is performed by all workstations, so parallelism of computations is higher than schemes using semi-distributed algorithm. This paper also offers a correctness proof of the scheme.
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.
