文章基本信息

标题：Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting
本地全文：下载
作者：János Varga
期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2019
卷号：288
页码：50-62
DOI：10.4204/EPTCS.288.5
语种：English
出版社：Open Publishing Association
摘要：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.