完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHwang, FKen_US
dc.contributor.authorZang, WNen_US
dc.date.accessioned2014-12-08T15:01:15Z-
dc.date.available2014-12-08T15:01:15Z-
dc.date.issued1997-12-01en_US
dc.identifier.issn1045-9219en_US
dc.identifier.urihttp://dx.doi.org/10.1109/71.640016en_US
dc.identifier.urihttp://hdl.handle.net/11536/150-
dc.description.abstractA file in a distributed database system is replicated on M sites and may contain corrupted pages. Abdel-Ghaffar 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.en_US
dc.language.isoen_USen_US
dc.subjectdata consistencyen_US
dc.subjectdata corruptionen_US
dc.subjectfault detectionen_US
dc.subjectfile comparisonen_US
dc.subjectReed-Solomon codeen_US
dc.titleDetecting corrupted pages in M replicated large filesen_US
dc.typeArticleen_US
dc.identifier.doi10.1109/71.640016en_US
dc.identifier.journalIEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMSen_US
dc.citation.volume8en_US
dc.citation.issue12en_US
dc.citation.spage1241en_US
dc.citation.epage1245en_US
dc.contributor.department應用數學系zh_TW
dc.contributor.departmentDepartment of Applied Mathematicsen_US
顯示於類別:期刊論文


文件中的檔案:

  1. 000071135200007.pdf

若為 zip 檔案,請下載檔案解壓縮後,用瀏覽器開啟資料夾中的 index.html 瀏覽全文。