 |
Free and accessible knowledge |
Conference papers
A Port Graph Rewriting Approach to Relational Database Modelling
Abstract : We present new algorithms to compute the Syntactic Closure and the Minimal Cover of a set of functional dependencies, using strategic port graph rewriting. We specify a Visual Domain Specific Language to model relational database schemata as port graphs, and provide an extension to port graph rewriting rules. Using these rules we implement strategies to compute a syntactic closure, analyse it and find minimal covers, essential for schema normalisation. The graph program provides a visual description of the computation steps coupled with analysis features not available in other approaches. We prove soundness and completeness of the computed closure. This methodology is implemented in PORGY.
Cited literature [30 references]
https://hal.archives-ouvertes.fr/hal-02316336
Contributor : Bruno Pinaud Connect in order to contact the contributor
Submitted on : Tuesday, October 15, 2019 - 11:24:47 AM
Last modification on : Tuesday, January 4, 2022 - 6:17:29 AM
Long-term archiving on: : Friday, January 17, 2020 - 8:08:41 AM
Contributor : Bruno Pinaud Connect in order to contact the contributor
Submitted on : Tuesday, October 15, 2019 - 11:24:47 AM
Last modification on : Tuesday, January 4, 2022 - 6:17:29 AM
Long-term archiving on: : Friday, January 17, 2020 - 8:08:41 AM
File
paper 11.pdf
Files produced by the author(s)