Judging Equivalence for Sets of Functional Dependencies Based on Truth Table

被引:0
|
作者
Zhang, Yishun [1 ]
机构
[1] ZheJiang GongShang Univ, Coll Comp & Informat Engn, Hangzhou, Zhejiang, Peoples R China
关键词
relational database; set of functional dependencies; Armstrong's axioms; mathematical logic; truth table; PROPOSITIONAL LOGIC; RELATIONAL DATABASE;
D O I
暂无
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
Data dependencies theory is the basic tool for analyzing and designing of relational database. How to Judge whether two sets of functional dependencies are equivalent? This is a basic and important problem solved by using Armstrong's axioms in data dependencies theory. In this paper we shall point out that the rules of inference in Armstrong's axioms system and propositional inference in mathematical logic are consistent. This implies that If each functional dependency is viewed as conditional proposition, equivalent sets of functional dependencies have the same truth table in mathematical logic, so we can judge equivalence of two set of functional dependencies by truth table.
引用
收藏
页码:112 / 115
页数:4
相关论文
共 50 条
  • [1] Functional dependencies in relational expressions based on or-sets
    Nakata, M
    Murai, T
    [J]. ROUGH SETS AND CURRENT TRENDS IN COMPUTING, PROCEEDINGS, 2002, 2475 : 161 - 166
  • [2] ON SETS TRUTH-TABLE REDUCIBLE TO SPARSE SETS
    BOOK, RV
    KO, KI
    [J]. SIAM JOURNAL ON COMPUTING, 1988, 17 (05) : 903 - 919
  • [3] Graphical reasoning for sets of functional dependencies
    Demetrovics, J
    Molnár, A
    Thalheim, B
    [J]. CONCEPTUAL MODELING - ER 2004, PROCEEDINGS, 2004, 3288 : 166 - 179
  • [4] On the Efficacy of Dynamic Behavior Comparison for Judging Functional Equivalence
    Kessel, Marcus
    Atkinson, Colin
    [J]. 2019 19TH IEEE INTERNATIONAL WORKING CONFERENCE ON SOURCE CODE ANALYSIS AND MANIPULATION (SCAM), 2019, : 193 - 203
  • [5] An efficient preprocessing transformation for functional dependencies sets based on the substitution paradigm
    Mora, A
    Enciso, M
    [J]. CURRENT TOPICS IN ARTIFICIAL INTELLIGENCE, 2004, 3040 : 136 - 146
  • [6] WEAK TRUTH TABLE REDUCIBILITY BETWEEN RE SETS
    LADNER, RE
    [J]. JOURNAL OF SYMBOLIC LOGIC, 1974, 39 (01) : 197 - 197
  • [7] SCHNORR TRIVIAL SETS AND TRUTH-TABLE REDUCIBILITY
    Franklin, Johanna N. Y.
    Stephan, Frank
    [J]. JOURNAL OF SYMBOLIC LOGIC, 2010, 75 (02) : 501 - 521
  • [8] Design by example for SQL table definitions with functional dependencies
    Sven Hartmann
    Markus Kirchberg
    Sebastian Link
    [J]. The VLDB Journal, 2012, 21 : 121 - 144
  • [9] Reformulating Positive Table Constraints Using Functional Dependencies
    Cambazard, Hadrien
    O'Sullivan, Barry
    [J]. PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, 2008, 5202 : 418 - 432
  • [10] Design by example for SQL table definitions with functional dependencies
    Hartmann, Sven
    Kirchberg, Markus
    Link, Sebastian
    [J]. VLDB JOURNAL, 2012, 21 (01): : 121 - 144