Abstract
In this paper NEST (UNNEST) is decomposed into attribute composition and tuple composition (into attribute decomposition and tuple decomposition, resp.). It is shown that by the complete graph and the edge labelling associated to a relation as in [3] we can represent the set of multi-valued dependencies in the given relation. Therefore, by this complete graph and edge labelling, we can represent Boolean dependencies and multivalued dependencies of the relation that we obtain from the given relation through tuple compositions and attribute compositions. A concept of insistency of operators is proposed. A necessary and sufficient condition for an operator to be ℱ-insistent for a given Boolean dependency ℱ is offered.
The research was supported by the Hungarian Foundation for Scientific Research Grant OTKA 2575.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
J. Berman, J. Blok: Positive boolean dependencies. Inform. Process. Letters, 27, 3 (1988), pp. 147–150.
J. Demetrovics, L. Rónyai, Hua nam Son: Dependency Types. Computers. Math. Applic. 21, 1 (1991), pp. 25–33.
J. Demetrovics, L. Rónyai, Hua nam Son: On the representation of dependencies by propositional logic. In: J. Demetrovics, B. Thalheim, H.-D. Gerhardt (eds): Proc. MFDBS 91 (Rostock, Germany). LNCS 495, Springer-Verlag 1991, pp. 230–242.
J. Demetrovics, L. Rónyai, Hua nam Son: Functional dependencies among BDs. (to appear).
R. Fagin: Functional dependencies in relational database and Propositional Logic. IBM J. Res. and Develop. 21, 6 (1977), 5, pp. 534–544.
P.C. Fischer, L.V. Saxion, S.J. Thomas, D.V. Gucht: Interactions between dependencies and nested relational structures. JCSS 31, 3 (1985), pp. 343–355.
G. Jaeschke, H.-J. Schek: Remarks on the algebra on non first normal form relations. In: Proc. ACM SIGACT-SIGMOD Symposium on Principles of database systems, 1982, pp. 124–138.
A. Makinouchi: A consideration on normal form of not-necessarily-normalized relations in the relational data model. In: Proc. of the Conference on Very Large Data Bases (Tokio, 1977), pp. 447–453.
Z.M. Ozsoyoglu, L.Y. Yuan: A new normal form for nested relations. ACM Trans on Database Systems, 12, 1 (1987), pp. 111–136.
Y. Sagiv, C. Delobel, D.S.JR. Parker, R. Fagin: An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic. JACM 28, 3 (1981), pp. 435–453.
Y. Sagiv, C. Delobel, D.S.JR. Parker, R. Fagin: Correction to “An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic”, JACM 34, 4 (1987), pp. 1016–1018.
B. Thalheim, S. Al-Fedhagi: Preserving two-tuple dependencies under projection. Acta Cybernetica 9, 4 (1990), pp. 441–458.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demetrovics, J., Rónyai, L., Son, H.n. (1992). On the composition and decomposition of attributes and tuples. In: Biskup, J., Hull, R. (eds) Database Theory — ICDT '92. ICDT 1992. Lecture Notes in Computer Science, vol 646. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56039-4_33
Download citation
DOI: https://doi.org/10.1007/3-540-56039-4_33
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56039-5
Online ISBN: 978-3-540-47360-2
eBook Packages: Springer Book Archive