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.
The work of the second and third author was supported by the Hungarian National Foundation for Scientific Research grant numbers T016389, T029255
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Armstrong, W.W., Dependency structures of data base relationship, in: Information Processing 74, North-Holland, Amsterdam, pp. 580–583.
Demetrovics, J., On the equivalence of candidate keys with Sperner systems, Acta Cybernet. 4(1979) 247–252.
Demetrovics J., Füredi, Z, and Katona, G.O.H.: Minimum matrix representation of closure operations, Discrete Appl. Math. 11(1985) 115–128.
Demetrovics J., G.O.H. Katona, Miklós, D.: Error-correcting keys in relational databases, in Foundations of Informationn and Knowledge Systems, FoIKS 2000 (K.-D. Schewe and B. Thalheim eds.) Lecture Notes in Computer Science, 1762, Springer, 2000, pp. 88–93.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demetrovics, J., Katona, G.O., Miklós, D. (2002). Functional Dependencies in Presence of Errors. In: Eiter, T., Schewe, KD. (eds) Foundations of Information and Knowledge Systems. FoIKS 2002. Lecture Notes in Computer Science, vol 2284. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45758-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-45758-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43220-3
Online ISBN: 978-3-540-45758-9
eBook Packages: Springer Book Archive