完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Hwang, FK | en_US |
dc.contributor.author | Zang, WN | en_US |
dc.date.accessioned | 2014-12-08T15:01:15Z | - |
dc.date.available | 2014-12-08T15:01:15Z | - |
dc.date.issued | 1997-12-01 | en_US |
dc.identifier.issn | 1045-9219 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1109/71.640016 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/150 | - |
dc.description.abstract | A 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.iso | en_US | en_US |
dc.subject | data consistency | en_US |
dc.subject | data corruption | en_US |
dc.subject | fault detection | en_US |
dc.subject | file comparison | en_US |
dc.subject | Reed-Solomon code | en_US |
dc.title | Detecting corrupted pages in M replicated large files | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1109/71.640016 | en_US |
dc.identifier.journal | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | en_US |
dc.citation.volume | 8 | en_US |
dc.citation.issue | 12 | en_US |
dc.citation.spage | 1241 | en_US |
dc.citation.epage | 1245 | en_US |
dc.contributor.department | 應用數學系 | zh_TW |
dc.contributor.department | Department of Applied Mathematics | en_US |
顯示於類別: | 期刊論文 |