Conferences in Research and Practice in Information Technology
  

Online Version - Last Updated - 20 Jan 2012

 

 
Home
 

 
Procedures and Resources for Authors

 
Information and Resources for Volume Editors
 

 
Orders and Subscriptions
 

 
Published Articles

 
Upcoming Volumes
 

 
Contact Us
 

 
Useful External Links
 

 
CRPIT Site Search
 
    

On the Implication Problem for Functional Dependencies in the Higher-Order Entity-Relationship Model

Kirchberg, M. and Link, S.

    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.
Cite as: Kirchberg, M. and Link, S. (2003). On the Implication Problem for Functional Dependencies in the Higher-Order Entity-Relationship Model. In Proc. Fourteenth Australasian Database Conference (ADC2003), Adelaide, Australia. CRPIT, 17. Schewe, K.-D. and Zhou, X., Eds. ACS. 115-124.
pdf (from crpit.com) pdf (local if available) BibTeX EndNote GS
 

 

ACS Logo© Copyright Australian Computer Society Inc. 2001-2014.
Comments should be sent to the webmaster at crpit@scem.uws.edu.au.
This page last updated 16 Nov 2007