Abstract
In Example 3.11 and Theorem 3.7 we saw that the presence of fds can give rise to lossless decompositions of a given relation scheme. We summarize the main advantages of decomposing a relation scheme:
-
smaller relations are easier to understand;
-
independent information should not be stored in one relation;
-
it is often possible to eliminate redundancy;
-
in distributed databases different components can be located in different sites.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Paredaens, J., De Bra, P., Gyssens, M., Van Gucht, D. (1989). Vertical Decompositions. In: The Structure of the Relational Database Model. EATCS Monographs on Theoretical Computer Science, vol 17. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69956-6_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-69956-6_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-69958-0
Online ISBN: 978-3-642-69956-6
eBook Packages: Springer Book Archive