What is it about?

To facilitate the management of relational databases, data should be organised according to some criteria, the so-called "normal forms", for which the notion of key attribute is important. In this paper, we provide declarative specifications of algorithms to compute candidate keys and 3NF (third normal form). The algorithms are written using graph transformation rules, applied according to a specific strategy. These graph transformation rules and strategies can be directly executed in a graph rewriting tool: we have used PORGY to run the algorithms. PORGY allows users to visualise the graph transformation steps, which provides additional insight into the algorithms.

Featured Image

Read the Original

This page is a summary of: Finding Candidate Keys and 3NF via Strategic Port Graph Rewriting, September 2020, ACM (Association for Computing Machinery),
DOI: 10.1145/3414080.3414090.
You can read the full text:

Read

Contributors

The following have contributed to this page