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

## TL;DR

This paper introduces a novel method using strategic port graph rewriting to compute the transitive closure of functional dependencies in relational database schemas, ensuring correctness and termination under certain conditions.

## Contribution

It presents a new graph-based approach for logical database design, modeling schemas as attributed port graphs and providing rewriting rules for dependency computations.

## Key findings

- The method is sound, complete, and terminating without cyclical dependencies.
- It effectively models relational schemata as port graphs.
- Provides a strategic graph program for transitive closure computation.

## Abstract

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.