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

被引:1
|
作者
Varga, Janos [1 ]
机构
[1] Kings Coll London, Dept Informat, London, England
关键词
D O I
10.4204/EPTCS.288.5
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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.
引用
收藏
页码:50 / 62
页数:13
相关论文
共 13 条
  • [1] ON THE INTERACTION BETWEEN TRANSITIVE CLOSURE AND FUNCTIONAL-DEPENDENCIES
    GOTTLOB, G
    SCHREFL, M
    STUMPTNER, M
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 364 : 187 - 206
  • [2] Strategic port graph rewriting: an interactive modelling framework
    Fernandez, Maribel
    Kirchner, Helene
    Pinaud, Bruno
    [J]. MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2019, 29 (05) : 615 - 662
  • [4] Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework
    Fernandez, Maribel
    Kirchner, Helene
    Pinaud, Bruno
    [J]. ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (159): : 15 - 29
  • [5] APPLICATION OF A METHOD OF FAST MULTIPLICATION OF MATRICES TO PROBLEM OF FINDING GRAPH TRANSITIVE CLOSURE
    FURMAN, ME
    [J]. DOKLADY AKADEMII NAUK SSSR, 1970, 194 (03): : 524 - &
  • [6] Query rewriting using views in the presence of functional and inclusion dependencies
    Gryz, J
    [J]. INFORMATION SYSTEMS, 1999, 24 (07) : 597 - 612
  • [7] Rewriting Aggregate Queries Using Functional Dependencies within the Cloud
    Perriot, Romain
    d'Orazio, Laurent
    Laurent, Dominique
    Spyratos, Nicolas
    [J]. INFORMATION SEARCH, INTEGRATION, AND PERSONALIZATION, 2014, 421 : 31 - 42
  • [8] A non-explosive treatment of functional dependencies using rewriting logic
    Aguilera, G
    Cordero, P
    Enciso, M
    Mora, A
    de Guzmán, IP
    [J]. ADVANCES IN ARTIFICIAL INTELLIGENCE - SBIA 2004, 2004, 3171 : 31 - 40
  • [9] Arbitrarily shaped rectilinear module placement using the transitive closure graph representation
    Lin, JM
    Chen, HL
    Chang, YW
    [J]. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2002, 10 (06) : 886 - 901
  • [10] Using Functional Dependencies in Conversion of Relational Databases to Graph Databases
    Megid, Youmna A.
    El-Tazi, Neamat
    Fahmy, Aly
    [J]. DATABASE AND EXPERT SYSTEMS APPLICATIONS (DEXA 2018), PT II, 2018, 11030 : 350 - 357