Affiliation:
1. Sobolev institute of mathematics SB RAS
Abstract
The paper discusses the theory and algorithms necessary to construct a minimal covering of generalized typed inclusion dependencies. Traditionally, the construction of minimal covering is used for all types of dependencies in order to obtain a non-redundant and consistent database design. Generalized inclusion dependencies correspond to referential integrity constraints, when several main and several external relations are involved in one constraint, which corresponds to an ultragraph edge. In previous work, based on a study of the properties of dependencies, a system of axioms was presented with proof of consistency and completeness. In this work, the closures were studied for generalized typed inclusion dependencies. An algorithm for constructing closures has been developed and its correctness has been proven. The results obtained are further used to develop an algorithm for constructing a minimal covering. At the end of the article, examples are presented that demonstrate the operation of the algorithms.
Publisher
P.G. Demidov Yaroslavl State University
Reference21 articles.
1. J. Ullman, Principles of Database Systems. Stanford University: Computer Science Press, 1980.
2. D. Maier, The Theory of Relational Databases. Rockville: Computer Science Press, 1983.
3. M. Casanova, R. Fagin, and C. Papadimitriou, “Inclusion dependencies and their interaction with functional dependencies,” Journal of Computer and System Sciences, vol. 28, no. 1, pp. 29–59, 1984.
4. A. K. Chandra and M. Y. Vardi, “The Implication Problem for Functional and Inclusion Dependencies is Undecidable,” SIAM Journal on Computing, vol. 14, no. 3, pp. 671–677, 1985, doi: 10.1137/0214049.
5. R. Fagin and M. Y. Vardi, “Armstrong databases for functional and inclusion dependencies,” Information Processing Letters, vol. 16, no. 1, pp. 13–19, 1983, doi: 10.1016/0020-0190(83)90005-4.