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 presen...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Open Publishing Association
2019-02-01
|
| Series: | Electronic Proceedings in Theoretical Computer Science |
| Online Access: | http://arxiv.org/pdf/1902.02013v1 |
| _version_ | 1818300617209151488 |
|---|---|
| author | János Varga |
| author_facet | János Varga |
| author_sort | János Varga |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-12-13T05:09:58Z |
| format | Article |
| id | doaj.art-bffd776d18c448ecb2ce95a9914d7227 |
| institution | Directory Open Access Journal |
| issn | 2075-2180 |
| language | English |
| last_indexed | 2024-12-13T05:09:58Z |
| publishDate | 2019-02-01 |
| publisher | Open Publishing Association |
| record_format | Article |
| series | Electronic Proceedings in Theoretical Computer Science |
| spelling | doaj.art-bffd776d18c448ecb2ce95a9914d72272022-12-21T23:58:34ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802019-02-01288Proc. TERMGRAPH 2018506210.4204/EPTCS.288.5:7Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph RewritingJános VargaWe 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.http://arxiv.org/pdf/1902.02013v1 |
| spellingShingle | János Varga Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting Electronic Proceedings in Theoretical Computer Science |
| title | Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting |
| title_full | Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting |
| title_fullStr | Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting |
| title_full_unstemmed | Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting |
| title_short | Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting |
| title_sort | finding the transitive closure of functional dependencies using strategic port graph rewriting |
| url | http://arxiv.org/pdf/1902.02013v1 |
| work_keys_str_mv | AT janosvarga findingthetransitiveclosureoffunctionaldependenciesusingstrategicportgraphrewriting |