Use this URL to cite or link to this record in EThOS: https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.819185
Title: A port graph rewriting system for visual data modelling
Author: Varga, Janos
ISNI:       0000 0004 9357 503X
Awarding Body: King's College London
Current Institution: King's College London (University of London)
Date of Award: 2020
Availability of Full Text:
Access from EThOS:
Access from Institution:
Abstract:
Relational database technology has been in use since the 1970s and design methodologies evolved since then. Despite four decades of continuous development, these design methodologies are still hard to understand and/or to follow. Surveys have shown that in very complex databases conceptual and/or logical modelling is omitted because the popular methodologies are too cumbersome (e.g. normal form checks). Not to mention the fact that the resulting model is hard to maintain (limited round-trip engineering capabilities). Database designers therefore require a purposely built tool that is aware of and enforces conceptual and logical database design principles. Currently available tools provide limited functionality of this kind and their model validation features are also limited. The motivation of this research is to provide database designers with a tool that makes database model validation easy and understandable; that makes database testing more straightforward and, all in all, a tool that promotes proper database designs. This thesis presents a new approach to relational database modelling, based on strategic port graph rewriting. More precisely, the contributions are as follows. A port graph visual language to model relational database schemata is presented. The standard notion of port graph rewrite rule is extended with generic Rule Application Conditions and pattern-based rule generators called Variadic Rewriting Rules. Port graph rewriting rules and strategies are provided to accomplish the following database design tasks: generating a Syntactic closure, finding a Minimal Cover, solving the Membership Problem, finding all candidate keys and obtaining 3NF. Correctness properties e.g. termination, soundness and completeness of these algorithms are shown. A prototype implementation of the Rule Application Conditions extension is provided in a port graph modelling framework called Porgy. Said database design strategies are also implemented in this framework and illustrated with examples.
Supervisor: Fernandez, Maria Isabel ; Tratt, Laurence Robert Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID: uk.bl.ethos.819185  DOI: Not available
Share: