Group testing and fault detection for replicated files
| dc.citation.epage | 242 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 231 | en_US |
| dc.citation.volume | 116 | en_US |
| dc.citation.woscount | 0 | |
| dc.contributor.author | Hwang, FK | en_US |
| dc.contributor.author | Zang, WN | en_US |
| dc.contributor.department | 應用數學系 | zh_TW |
| dc.contributor.department | Department of Applied Mathematics | en_US |
| dc.date.accessioned | 2014-12-08T15:42:48Z | |
| dc.date.available | 2014-12-08T15:42:48Z | |
| dc.date.issued | 2002-02-15 | en_US |
| dc.description.abstract | A file in a distributed database system is replicated on M sites and may contain corrupted pages. The purpose of this paper is to apply a group testing technique to detect corrupted pages in these replicated files. Our detection scheme, based on the structure of the Reed-Solomon code as proposed by Abdel-Ghaffar and El Abbadi, is optimal for M greater than or equal to 4 and has performance guarantee of (7)-(6) for M = 3. (C) 2002 Elsevier Science B.V. All rights reserved. | en_US |
| dc.identifier.doi | 10.1016/S0166-218X(00)00325-5 | en_US |
| dc.identifier.issn | 0166-218X | en_US |
| dc.identifier.journal | DISCRETE APPLIED MATHEMATICS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1016/S0166-218X(00)00325-5 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/29011 | |
| dc.identifier.wosnumber | WOS:000173740700003 | |
| dc.language.iso | en_US | en_US |
| dc.subject | group testing | en_US |
| dc.subject | Reed-Solomon code | en_US |
| dc.subject | maximum clique | en_US |
| dc.subject | depth-first search | en_US |
| dc.title | Group testing and fault detection for replicated files | en_US |
| dc.type | Article | en_US |