Error-Correcting Keys in Relational Databases
FoIKS '00 Proceedings of the First International Symposium on Foundations of Information and Knowledge Systems
Minimum matrix representation of closure operations
Discrete Applied Mathematics
Error-robust functional dependencies
Fundamenta Informaticae
Distance functional dependencies in the presence of complex values
Acta Cybernetica
Functional dependencies distorted by errors
Discrete Applied Mathematics
Using error-correcting dependencies for collaborative filtering
Data & Knowledge Engineering
Error-Robust Functional Dependencies
Fundamenta Informaticae
| Hi-index | 0.00 |
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.