利用策略端口图重写寻找函数递归的传递闭包
Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting
摘要：
提出了一种基于策略端口图重写的关系数据库逻辑设计新方法。我们展示了如何建模关系模式的属性端口图，并提供端口图重写规则来执行功能依赖的计算。利用这些规则，我们提出了一个战略图程序，以找到一组函数依赖的传递闭包。这个程序是合理的，完整的和终止的，假设在模式中没有循环依赖。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
