Abstract
In relational databases, operations including joins sometimes become a cause of performance problems. We study scheme transformations to reduce the number of joins used by a class of routine database activities whose access patterns are fixed. Two scheme operations, merge and copy, are defined to transform relation schemes. The former merges two relation schemes into one, and the latter copies a functional dependency of a relation scheme to its tightly related relation scheme. Necessary and sufficient conditions are shown for applying these operations to a database scheme such that no new anomalies occur. From the necessity of the conditions, the database scheme obtained by exhaustive applications of these operations as long as the conditions hold, is optimal in the sense that further application of one of the scheme operations to the database scheme would cause anomalies. It is also proved that the resulting view of a retrieval on the original database scheme is equivalent to that of the corresponding retrieval on the new database scheme.
Preview
Unable to display preview. Download preview PDF.
References
C.J.Date: “An Introduction to Database Systems” (Third Edition), Addison-Wesley (1981)
D.Maier: “The Theory of Relational Databases”, Computer Science Press (1983).
J.Martin: “Managing the Data-Base Environment”, Prentice-Hall (1983)
F.McFadden, J.Hoffer: “Data Base Management” (Second Edition), The Benjamin/Cummings Publishing (1988).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nakanishi, M., Katsuyama, Y., Ito, M., Hashimoto, A. (1991). On designing relational database schemes for efficient query processing. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_175
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_175
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive