AI Chat AI Image Generator AI Video Text to Speech

Finding the Transitive Closure of Functional Dependencies using Strategic Port Graph Rewriting

02/06/2019

∙

by János Varga, et al.

∙

∙

We present a new approach to the logical design of relational databases, based on strategic port graph rewriting. We show how to model relational schemata as attributed port graphs and provide port graph rewriting rules to perform computations on functional dependencies. Using these rules we present a strategic graph program to find the transitive closure of a set of functional dependencies. This program is sound, complete and terminating, assuming that there are no cyclical dependencies in the schema.

research

∙ 02/19/2018

Attributed Hierarchical Port Graphs and Applications

We present attributed hierarchical port graphs (AHP) as an extension of ...

0 Nneka Chinelo Ene, et al. ∙

research

∙ 08/19/2021

Temporal Graph Functional Dependencies: Technical Report

Data dependencies have been extended to graphs e.g., graph functional de...

0 Morteza Alipourlangouri, et al. ∙

research

∙ 09/15/2017

A Rule-Based Approach to Analyzing Database Schema Objects with Datalog

Database schema elements such as tables, views, triggers and functions a...

0 Christiane Engels, et al. ∙

research

∙ 06/05/2023

A Plaque Test for Redundancies in Relational Data

Inspired by the visualization of dental plaque at the dentist's office, ...

0 Christoph Köhnen, et al. ∙

research

∙ 05/23/2023

The Context Model: A Graph Database Model

In the relational model a relation over a set of attributes is defined t...

0 Nicolas Spyratos, et al. ∙

research

∙ 07/11/2019

The Next 700 Relational Program Logics

We propose the first framework for defining relational program logics fo...

0 Kenji Maillard, et al. ∙

research

∙ 04/05/2023

FASTAGEDS: Fast Approximate Graph Entity Dependency Discovery

This paper studies the discovery of approximate rules in property graphs...

0 Guangtong Zhou, et al. ∙