A Port Graph Rewriting Approach to Relational Database Modelling

DOI10.1007/978-3-030-45260-5_13zbMath1502.68114OpenAlexW2969864432MaRDI QIDQ5097637

János Varga, Maribel Fernández, Bruno Pinaud

Publication date: 25 August 2022

Published in: Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45260-5_13

zbMATH Keywords

functional dependencydatabase designrelational databasesminimal covergraph transformationport graph

Mathematics Subject Classification ID

Database theory (68P15) Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algebraic approach to single-pushout graph transformation
• Labelled graph strategic rewriting for social networks
• Graph Algorithms for Functional Dependency Manipulation
• Minimum Covers in Relational Database Model
• Strategic port graph rewriting: an interactive modelling framework
• An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
• Handbook of Graph Grammars and Computing by Graph Transformation

This page was built for publication: A Port Graph Rewriting Approach to Relational Database Modelling