By Topic

Detecting corrupted pages in M replicated large files

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
F. K. Hwang ; Dept. of Appl. Math., Nat. Chiao Tung Univ., Hsinchu, Taiwan ; Wenan Zang

A file in a distributed database system is replicated on M sites and may contain corrupted pages. Abdel-Ghafiar and El Abbadi gave a detection scheme assuming that the number of corrupted pages f<M/2. We replace this assumption by a much weaker one, that, for each page, the majority of copies are correct. Our schemes are based on the structure of the Reed-Solomon code, as proposed by Abdel-Ghaffar and El Abbadi for M=2

Published in:

IEEE Transactions on Parallel and Distributed Systems  (Volume:8 ,  Issue: 12 )