Skip to Main content Skip to Navigation
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.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02316336
Contributor : Bruno Pinaud <>
Submitted on : Tuesday, October 15, 2019 - 11:24:47 AM
Last modification on : Monday, June 8, 2020 - 2:29:04 PM
Long-term archiving on: : Friday, January 17, 2020 - 8:08:41 AM

File

paper 11.pdf
Files produced by the author(s)

Identifiers

Citation

Maribel Fernández, Bruno Pinaud, Janos Varga. A Port Graph Rewriting Approach to Relational Database Modelling. 29th International Symposium on Logic-based Program Synthesis and Transformation (LOPSTR 2019), Oct 2019, Porto, Portugal. pp.211-227, ⟨10.1007/978-3-030-45260-5_13⟩. ⟨hal-02316336⟩

Share

Metrics

Record views

94

Files downloads

146