On the implication problem for functional dependencies in the higher-order entity-relationship model

Authors:
Markus Kirchberg;Sebastian Link
Affiliations:
Department of Information Systems, Massey University, Private Bag 11222, Palmerston North, New Zealand;Department of Information Systems, Massey University, Private Bag 11222, Palmerston North, New Zealand
Venue:
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Year:
2003

Citing 6
Cited 0

A new normal form for nested relations

ACM Transactions on Database Systems (TODS)
The structure of the relational database model

The structure of the relational database model
A normal form for precisely characterizing redundancy in nested relations

ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Entity-Relationship Modeling: Foundations of Database Technology

Entity-Relationship Modeling: Foundations of Database Technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

Functional Dependencies have recently been generalized (Hoffmann, Link, Schewe 2002) to the Higher-Order Entity-Relationship Model (HERM). A sound and complete set of rules for the implication of these functional dependencies has also generalized the well-known Armstrong Axioms from the Relational Data Model (RDM) to the HERM.This article proposes algorithms which solve the implication problem for generalized functional dependencies in the HERM efficiently. Correctness and complexity results are proven. The main result shows that the implication problem for functional dependencies in the HERM is decidable in linear time. Some applications of the implication problem for generalized functional dependencies are discussed. Algorithms are implemented and tested.