Abstract
Suppose that the entries of a relational database are collected in an unreliable way, that is the actual database may differ from the true database in at most one data of each individual. An error-correcting key is such a set of attributes, that the knowledge of the actual data of an individual in this set of attributes uniquely determines the individual. It is showed that if the minimal keys are of size at most k, then the smallest sizes of the minimal error-correcting keys can be ck 3 and this is the best possible, all minimal error-correcting keys have size at most 3k 3.
The work of the second and third authors was supported by the Hungarian National Foundation for Scientific Research grant numbers 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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demetrovics, J., Katona, G.O.H., Miklós, D. (2000). Error-Correcting Keys in Relational Databases. In: Schewe, KD., Thalheim, B. (eds) Foundations of Information and Knowledge Systems. FoIKS 2000. Lecture Notes in Computer Science, vol 1762. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46564-2_6
Download citation
DOI: https://doi.org/10.1007/3-540-46564-2_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67100-8
Online ISBN: 978-3-540-46564-5
eBook Packages: Springer Book Archive