Abstract
In the study of the relational database model, the vertical decomposition of relations into projections of these relations was emphasized since the introduction in /CODD 72/. The use of vertical decompositions always requires some constraints to be satisfied, for instance a join dependency or a functional dependency, in order to be able to regain the original relation by taking the join of its projections. In /ARDE 80/, /THAL 84/ and AABM 80/ the idea of D. Smith and J. Smith /SMSM 77/, to decompose a relation horizontally into restrictions of these relations, using the union as composition operator, was formalized, using Codd-functional and multivalued dependencies. Such horizontal decompositions /DBPA 83/ are useful in the normalization of schemata in which hidden constraints are involved.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1991 Springer Fachmedien Wiesbaden
About this chapter
Cite this chapter
Thalheim, B. (1991). Horizontal Decomposition Dependencies. In: Dependencies in Relational Databases. Teubner-Texte zur Mathematik. Vieweg+Teubner Verlag, Wiesbaden. https://doi.org/10.1007/978-3-663-12018-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-663-12018-6_8
Publisher Name: Vieweg+Teubner Verlag, Wiesbaden
Print ISBN: 978-3-663-12019-3
Online ISBN: 978-3-663-12018-6
eBook Packages: Springer Book Archive