FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting

Author: János Varga

Paper Information

Title:Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting
Authors:János Varga
Proceedings:TERMGRAPH Pre-proceedings
Editors: Maribel Fernandez and Ian Mackie
Keywords:relational databases, logical design, functional dependency, relational theory, port graphs, strategic graph rewriting
Abstract:

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, given the restriction that there are no cyclical dependencies in the schema.

Pages:9
Talk:Jul 07 17:00 (Session 31Q: Applications)
Paper: