A Port Graph Rewriting Approach to Relational Database Modelling - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

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.
Fichier principal
Vignette du fichier
paper 11.pdf (791.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02316336 , version 1 (15-10-2019)

Identifiers

Cite

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⟩
129 View
191 Download

Altmetric

Share

Gmail Facebook X LinkedIn More