Dependencies and generalized relations

Authors:
J. Demetrovics;L. Ronyai;S. Hua Nam
Affiliations:
Computer and Automation Institute, Hungarian Academy of Sciences Lágymányosi u. 11, H-1111 Budapest, Hungary;Computer and Automation Institute, Hungarian Academy of Sciences Lágymányosi u. 11, H-1111 Budapest, Hungary;Computer and Automation Institute, Hungarian Academy of Sciences Lágymányosi u. 11, H-1111 Budapest, Hungary
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2003

Citing 6
Cited 0

Interactions between dependencies and nested relational structures

Journal of Computer and System Sciences
Partition semantics for relations

Journal of Computer and System Sciences
On the equivalence of an Egd to a set of Fd's

Journal of the ACM (JACM)
On the representation of dependencies by propositional logic

MFDBS 91 Proceedings of the 3rd symposium on Mathematical fundamentals of database and knowledge base systems
The number of keys in relational and nested relational databases

Discrete Applied Mathematics - Special issue on combinatorial problems in databases
A consideration on normal form of not-necessarily-normalized relation in the relational data model

VLDB '77 Proceedings of the third international conference on Very large data bases - Volume 3

Quantified Score

Hi-index	0.98

Visualization

Abstract

A combinatorial, data-oriented approach is suggested to study generalized relational databases (GRDs) and generalized functional dependencies (GFDs). GRDs, as defined here, extend the traditional relational model by Codd. Also, certain aspects of nonfirst-normal-form databases and databases with null values can be captured in the setting of GRDs. We show that, after a suitable transformation, GFDs can be described in the framework of traditional functional dependencies (FDs). This leads to a convenient description of GFDs in terms of propositional logic.