Name
Abstract | ||
|---|---|---|
A relational database D is given with 驴 as the set of attributes. The rows (tuples, data of one individual) are transmitted through a noisy channel. It is supposed that at most one data in a row can be changed by the transmission. We say that A 驴 b (A 驴 驴, b 驴 驴) is an error-correcting functional dependency if the data in A uniquely determine the data in b in spite of the error. We investigate the problem how much larger a minimal error-correcting functional dependency can be than the original one. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-45758-5_6 | FoIKS |
Keywords | Field | DocType |
functional dependencies,noisy channel,relational database,error-correcting functional dependency,minimal error-correcting functional dependency,error correction,functional dependency | Row,Discrete mathematics,Relational database,Tuple,Computer science,Algorithm,Communication channel,Error detection and correction,Functional dependency,Spite | Conference |
ISBN | Citations | PageRank |
3-540-43220-5 | 4 | 0.62 |
References | Authors | |
5 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| János Demetrovics | 1 | 414 | 163.60 |
| Gyula O. H. Katona | 2 | 264 | 66.44 |
| Dezsö Miklós | 3 | 16 | 11.14 |