Abstract
In order to eliminate redundant information in a database one usually uses decomposition or special database design methods to achieve Third Normal Form (or some other normal form like Boyce-Codd Normal Form). This method of database design assumes that the real world satisfies very strong constraints like functional dependencies (fds), without any exceptions.
Most databases in “Whatever” Normal Form still contain a large amount of duplicated information, because the real world satisfies very few constraints, but a lot of “almost” constrains. Horizontal Fragments (resulting from Horizontal Decomposition) can be used to separate information with different properties. The different constraints that hold in these fragments can be used to eliminate redundant information in the fragments.
We focus on the horizontal decomposition for eliminating exceptions to fds. We show how to update such horizontally decomposed databases in an efficient way.
Generating separate horizontal fragments for all desired fds that do not hold in the real world may not be possible (although for every fd there will be a fragment for its exceptions, but the fragments for a number of fds may coincide). The number of fds for which a separate exception fragment can be generated depends on the choice of fds and the order in which they are used. We show that it is possible to find (in polynomial time) the order which leads to the “optimal” decomposition of a relation into horizontal fragments.
Preview
Unable to display preview. Download preview PDF.
References
Ceri S., G. Pelagatti, Distributed Databases: Principles and Systems, McGraw-Hill, 1984.
De Bra P., J. Paredaens, The Membership and the Inheritance of Functional and Afunctional Dependencies. Proc. of the Colloquium on Algebra, Combinatorics and Logic in Computer Science, Gyor, Hungary, pp. 315–330, 1983.
De Bra P., J. Paredaens, Horizontal Decompositions for Handling Exceptions to Functional Dependencies. in Advances in Database Theory, vol. II, H. Gallaire, J. Minker, J.-M. Nicolas, eds., pp. 123–144, Plenum, New York, 1983.
De Bra P., Horizontal Decompositions in the Relational Database Model, thesis, University of Antwerp, 1987.
Delgrande J.P., Formal bounds on the automatic generation and maintenance of integrity constraints. Proc. of the Sixth ACM PODS conference, March 1987, pp. 185–189.
Mannila H., K.-J. Räihä, Design by example: an application of Armstrong relations, Journal of Computer and System Sciences 33, nr. 2, pp. 126–141, 1986.
Mannila H., K.-J. Räihä, Algorithms for Inferring Functional Dependencies, extended abstract presented at VLDB 1987.
Paredaens J., P. De Bra, M. Gyssens, D. Van Gucht, The Structure of the Relational Database Model, EATCS Monographs on Computer Science, Springer Verlag, 1989.
Ullman J., Principles of Database and Knowledge-base Systems, Volume 1, Computer Science Press, Rockville, MD, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Bra, P., Paredaens, J. (1990). Removing redundancy and updating databases. In: Abiteboul, S., Kanellakis, P.C. (eds) ICDT '90. ICDT 1990. Lecture Notes in Computer Science, vol 470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53507-1_81
Download citation
DOI: https://doi.org/10.1007/3-540-53507-1_81
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53507-2
Online ISBN: 978-3-540-46682-6
eBook Packages: Springer Book Archive