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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
