A Parity Structure for Large Remotely Located Replicated Data Files

Authors:
J. J. Metzner
Affiliations:
School of Engineering and Computer Science, Oakland University
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 4
Cited 3

Optimistic methods for concurrency control in distributed database systems

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Queueing Analysis of Global Locking Synchronization Schemes for Multicopy Databases

IEEE Transactions on Computers
A Distributed Control Algorithm for Reliably and Consistently Updating Replicated Databases

IEEE Transactions on Computers
Feature analysis of selected database recovery techniques

AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference

Locating more corruptions in a replicated file

SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
Improved File Synchronization Techniques for Maintaining Large Replicated Collections over Slow Networks

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Algebraic Signatures for Scalable Distributed Data Structures

ICDE '04 Proceedings of the 20th International Conference on Data Engineering

Quantified Score

Hi-index	14.98

Visualization

Abstract

This paper proposes a parity structure for large remotely located replicated data files. The parity structure can accomplish the following objectives. 1) Ascertain with a high degree of confidence whether two or more files are identical, using a very small amount of communication. 2) If there is disagreement between two files, the disagreeing portion can be located simply and with a small amount of communication. 3) Memory faults within each individual file can be detected simply and with high probability.