A port graph rewriting approach to relational database modelling
From MaRDI portal
Publication:5097637
Recommendations
Cites work
- scientific article; zbMATH DE number 3823168 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 3624770 (Why is no real title available?)
- scientific article; zbMATH DE number 1231673 (Why is no real title available?)
- scientific article; zbMATH DE number 7450014 (Why is no real title available?)
- Algebraic approach to single-pushout graph transformation
- An Efficient Algorithm to Compute the Candidate Keys of a Relational Database Schema
- Extending the interaction nets calculus by generic rules
- Graph Algorithms for Functional Dependency Manipulation
- Handbook of Graph Grammars and Computing by Graph Transformation
- Labelled graph strategic rewriting for social networks
- Minimum Covers in Relational Database Model
- PORGY: strategy-driven interactive transformation of graphs
- Strategic port graph rewriting: an interactive modelling framework
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)