Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting
Databases
2019-02-07 v1
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.
Keywords
Cite
@article{arxiv.1902.02013,
title = {Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting},
author = {János Varga},
journal= {arXiv preprint arXiv:1902.02013},
year = {2019}
}
Comments
In Proceedings TERMGRAPH 2018, arXiv:1902.01510