Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting

János Varga

We present a new approach to the logical design of relational databases, based on strategic port graph rewriting. We show how to model relational schemata as attributed port graphs and provide port graph rewriting rules to perform computations on functional dependencies. Using these rules we present a strategic graph program to find the transitive closure of a set of functional dependencies. This program is sound, complete and terminating, assuming that there are no cyclical dependencies in the schema.

In Maribel Fernández and Ian Mackie: Proceedings Tenth International Workshop on Computing with Terms and Graphs (TERMGRAPH 2018), Oxford, UK, 7th July 2018, Electronic Proceedings in Theoretical Computer Science 288, pp. 50–62.
Published: 6th February 2019.

ArXived at: http://dx.doi.org/10.4204/EPTCS.288.5 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org