Abstract
A semantics of propositional logic is given to describe functional dependencies (FDs) and boolean dependencies (BDs). Armstrong relations are characterized for both FDs and BDs. In the case of FDs propositional logic is applied to find Armstrong relations and keys. BDs are not Armstrong dependencies. The problem to decide if a given BD has an Armstrong relation is shown to be an NP-hard problem. For BDs keys and covers are viewed as keysets. An algorithm to find keysets is given.
The research was partly supported by the Hungarian Foundation for Scientific Research Grant OTKA 1066.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Armstrong, W.W. Dependency Structures of Database Relationships. Information Processing 74, North-Holland Pub. Co. (1974), 580–583.
Beeri, C., Dowd, M., Fagin, R. and Statman, R. On the structure of Armstrong Relations for Functional Dependencies. J. ACM. 31 1(1984), 30–46.
Békéssy, A. and Demetrovics, J. Contribution to Theory of database relation. Discrete Math. 27 (1979), 1–10.
Burosh, G., Demetrovics, J. and Katona, G. O. J. The poset of closures as a model of changing database. Order 4 (1987), 127–142.
Delobel, C. and Casey, R.G. Decomposition of database and the Theory of Boolean swiching functions. IBM J. Res. Develop. 17 5(1973), 374–386.
Demetrovics, J. On the equivalence of candidate keys with Sperner systems, Acta Cybernetica 4 3 (1979), 247–252.
Demetrovics, J. and Gyepesi, Gy. Some generalized type functional dependencies formalized as equality set on matrices. Discrete Applied Mathematics 6 (1983), 35–47
Demetrovics, J., Rónyai, L. and Hua nam Son. Dependency Types. Computers Math. Applic. 21 1 (1991), 25–33.
Fagin, R. Functional dependencies in relational database and Propositional Logic. IBM J. Res. and Develop. 21 6(1977) 5, 534–544.
Fagin, R. Horn Clauses and Database Dependencies. J. ACM. 29 4 (1982), 952–985.
Gottlob, G. On the size of nonredundant FD-covers. Inf. Processing Letters 24 (1987), 355–360.
Maier, D. The Theory of Relational Databases. Computer Science Press, 1983.
Mannila, H. and Räihä, K-J. Design by Example: An Application of Armstrong Relations. JCSS 33 (1986), 126–141
Mannila, H. and Räihä, K-J. On the complexity of inferring functional dependencies. Manuscript. 1989.
Sadri, F., Data Dependencies in the Relational Model of Data: A Generalization. Doctoral Diss., Princeton Univ., Princeton, NJ, October 1980.
Sagiv, Y., Delobel, C., Parker, D.S.JR., Fagin, R., An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic, JACM 28 3(1981), 435–453.
Sagiv, Y., Delobel, C., Parker, D.S.JR., Fagin, R., Correction to “An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic”, JACM 34 4(1987), 1016–1018.
Schöning, U., Logic for Computer Scientists, Birkhäuser, 1989.
Thalheim, B., Funktionale Abhängigkeiten in relationalen Datenstrukturen. EIK, 1985, 1/2, 23–33.
Thalheim, B., Design tools for large relational database systems. MTA SZTAKI Közlemények 37 (1987), 171–183.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demetrovics, J., Rónyai, L., Son, H.n. (1991). On the representation of dependencies by propositional logic. In: Thalheim, B., Demetrovics, J., Gerhardt, H.D. (eds) MFDBS 91. MFDBS 1991. Lecture Notes in Computer Science, vol 495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54009-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-54009-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54009-0
Online ISBN: 978-3-540-47348-0
eBook Packages: Springer Book Archive