A port graph rewriting approach to relational database modelling
From MaRDI portal
Publication:5097637
DOI10.1007/978-3-030-45260-5_13zbMATH Open1502.68114OpenAlexW2969864432MaRDI QIDQ5097637FDOQ5097637
Authors: Maribel Fernández, Bruno Pinaud, János Varga
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
Recommendations
Cites Work
- Title not available (Why is that?)
- PORGY: strategy-driven interactive transformation of graphs
- Title not available (Why is that?)
- Graph Algorithms for Functional Dependency Manipulation
- Minimum Covers in Relational Database Model
- Handbook of Graph Grammars and Computing by Graph Transformation
- An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
- Title not available (Why is that?)
- Algebraic approach to single-pushout graph transformation
- Labelled graph strategic rewriting for social networks
- Strategic port graph rewriting: an interactive modelling framework
- Extending the interaction nets calculus by generic rules
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: A port graph rewriting approach to relational database modelling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5097637)