Multidimensional Timestamp Protocols for Concurrency Control
IEEE Transactions on Software Engineering
Efficient detection of corrupted pages in a replicated file
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Comparing File Copies with at Most Three Disagreeing Pages
IEEE Transactions on Computers
Locating Corruptions in a Replicated File in a Distributed Environment
The Journal of Supercomputing
Communication complexity of document exchange
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Efficient Location of Discrepancies in Multiple Replicated Large Files
IEEE Transactions on Parallel and Distributed Systems
Transaction Processing in Mobile, Heterogeneous Database Systems
IEEE Transactions on Knowledge and Data Engineering
An Optimal Strategy for Comparing File Copies
IEEE Transactions on Parallel and Distributed Systems
Detecting Corrupted Pages in M Replicated Large Files
IEEE Transactions on Parallel and Distributed Systems
Locating more corruptions in a replicated file
SRDS '96 Proceedings of the 15th Symposium on Reliable Distributed Systems
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Efficient detection of discrepancies in multiple file copies
Distributed Computing
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
| Hi-index | 14.98 |
The author improves on some previous work involving data transfer to find the location of disagreements between two or more large remote data files. Some procedures that permit a significant reduction in the number of back-and-forth interchanges are described, one of which significantly reduces the total amount of data transfer required. The older scheme could locate a disagreeing page with an extremely high degree of confidence more than one interchange. The new procedures require at most one back-and-forth interchange for each disagreeing page, often considerably less.