On the composition and decomposition of attributes and tuples

J. Demetrovics, L. Rónyai, Hua Nam Son

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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 multivalued 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. F-insistent for a given Boolean dependency. F is offered.

Original languageEnglish
Title of host publicationDatabase Theory - ICDT 1992 - 4th International Conference, Proceedings
PublisherSpringer Verlag
Pages71-85
Number of pages15
ISBN (Print)9783540560395
Publication statusPublished - Jan 1 1992
Event4th International Conference on Database Theory, ICDT 1992 - Berlin, Germany
Duration: Oct 14 1992Oct 16 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume646 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other4th International Conference on Database Theory, ICDT 1992
CountryGermany
CityBerlin
Period10/14/9210/16/92

Fingerprint

Attribute
Edge Labeling
Decomposition
Decompose
Multivalued
Chemical analysis
Complete Graph
Labeling
Graph Labeling
Operator
Necessary Conditions
Sufficient Conditions

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Demetrovics, J., Rónyai, L., & Son, H. N. (1992). On the composition and decomposition of attributes and tuples. In Database Theory - ICDT 1992 - 4th International Conference, Proceedings (pp. 71-85). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 646 LNCS). Springer Verlag.

On the composition and decomposition of attributes and tuples. / Demetrovics, J.; Rónyai, L.; Son, Hua Nam.

Database Theory - ICDT 1992 - 4th International Conference, Proceedings. Springer Verlag, 1992. p. 71-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 646 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Demetrovics, J, Rónyai, L & Son, HN 1992, On the composition and decomposition of attributes and tuples. in Database Theory - ICDT 1992 - 4th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 646 LNCS, Springer Verlag, pp. 71-85, 4th International Conference on Database Theory, ICDT 1992, Berlin, Germany, 10/14/92.
Demetrovics J, Rónyai L, Son HN. On the composition and decomposition of attributes and tuples. In Database Theory - ICDT 1992 - 4th International Conference, Proceedings. Springer Verlag. 1992. p. 71-85. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Demetrovics, J. ; Rónyai, L. ; Son, Hua Nam. / On the composition and decomposition of attributes and tuples. Database Theory - ICDT 1992 - 4th International Conference, Proceedings. Springer Verlag, 1992. pp. 71-85 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{07ae601706184f2880b098b0f8007de6,
title = "On the composition and decomposition of attributes and tuples",
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 multivalued 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. F-insistent for a given Boolean dependency. F is offered.",
author = "J. Demetrovics and L. R{\'o}nyai and Son, {Hua Nam}",
year = "1992",
month = "1",
day = "1",
language = "English",
isbn = "9783540560395",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "71--85",
booktitle = "Database Theory - ICDT 1992 - 4th International Conference, Proceedings",

}

TY - GEN

T1 - On the composition and decomposition of attributes and tuples

AU - Demetrovics, J.

AU - Rónyai, L.

AU - Son, Hua Nam

PY - 1992/1/1

Y1 - 1992/1/1

N2 - 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 multivalued 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. F-insistent for a given Boolean dependency. F is offered.

AB - 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 multivalued 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. F-insistent for a given Boolean dependency. F is offered.

UR - http://www.scopus.com/inward/record.url?scp=0242647928&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0242647928&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0242647928

SN - 9783540560395

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 71

EP - 85

BT - Database Theory - ICDT 1992 - 4th International Conference, Proceedings

PB - Springer Verlag

ER -