Abstract
It is well known that faithful (i.e. dependency preserving) decompositions of relational database schemas into Boyce-Codd Normal Form (BCNF) do not always exist, depending on the set of functional dependencies given, and that the corresponding decision problem is NP-hard. The only algorithm to guarantee both faithfulness and BCNF (if possible) proposed so far in [Os79] is a brute-force approach which always requires exponential time. To be useful in practice, e.g. in automated design tools, we require more efficient means.
In this paper we present an algorithm which always finds a faithful BCNF decomposition if one exists, and which is usually efficient, and exponential only in notorious cases.
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
Luccesi, C.L., Osborn, S.L.: Candidate Keys for Relations. Journal of Computer and System Sciences 17(2), 270–279 (1978)
Osborn, S.L.: Testing for Existance of a Covering Boyce-Codd Normal Form. Information Processing Letters 8(1), 11–14 (1979)
Beeri, C., Bernstein, P.A.: Computational Problems Related to the Design of Normal Form Relational Schemas. ACM Transactions on Database Systems 4(1), 30–59 (1979)
Biskup, J., Dayal, U., Bernstein, P.A.: Synthesizing Independent Databse Schemas. In: Proceedings of the 1979 ACM SIGMOD international conference on Management of data, pp. 143–151 (1979)
Tsou, D.-M., Fischer, P.C.: Decomposition of a Relation Scheme into Boyce-Codd Normal Form. In: Proceedings of the ACM 1980 annual conference, pp. 411–417 (1980)
Gottlob, G.: Computing Covers for Embedded Functional Dependencies. In: Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 58–69 (1987)
Mannila, H., Räihä, K.-J.: The Design of Relational Databases. Addison-Wesley, Reading (1987)
Majster-Cederbaum, M.E.: Ensuring the existence of a BCNF-decomposition that preserves functional dependencies in O(N 2) time. Information Processing Letters 43(2), 95–100 (1992)
Levene, M., Loizou, G.: A Guided Tour of Relational Databases and Beyond. Springer, Heidelberg (1999)
Schewe, K.-D.: Redundancy, Dependencies and Normal Forms for XML Databases. In: Proceedings of the Sixteenth Australasian Database Conference (ADC 2005), CRPIT, vol. 39, pp. 7–16 (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koehler, H. (2006). Finding Faithful Boyce-Codd Normal Form Decompositions. In: Cheng, SW., Poon, C.K. (eds) Algorithmic Aspects in Information and Management. AAIM 2006. Lecture Notes in Computer Science, vol 4041. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11775096_11
Download citation
DOI: https://doi.org/10.1007/11775096_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35157-3
Online ISBN: 978-3-540-35158-0
eBook Packages: Computer ScienceComputer Science (R0)