Functional Dependencies with null Markers

被引:5
作者
Badia, Antonio [1 ]
Lemire, Daniel [2 ]
机构
[1] Univ Louisville, CECS Dept, Louisville, KY 40292 USA
[2] Univ Quebec, LICEF, Montreal, PQ H2S 3L5, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
functional dependencies; database design; missing information; INCOMPLETE RELATIONS; VALUES;
D O I
10.1093/comjnl/bxu039
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Functional dependencies (FDs) are an integral part of database design. However, they are only defined when we exclude null markers. However, we commonly use null markers in practice. To bridge this gap between theory and practice, researchers have proposed definitions of FDs over relations with null markers. Though sound, these definitions lack some qualities that we find desirable. For example, some fail to satisfy Armstrong's axioms-while these axioms are part of the foundation of common database methodologies. We propose a set of properties that any extension of FDs over relations with null markers should possess. We then propose two new extensions having these properties. These extensions attempt to allow null markers where they make sense to practitioners. They both support Armstrong's axioms and provide realizable null markers: at any time, some or all of the null markers can be replaced by actual values without causing an anomaly. Our proposals may improve database designs.
引用
收藏
页码:1160 / 1168
页数:9
相关论文
共 16 条
[1]  
[Anonymous], 1980, Modal Logic-An Introduction
[2]  
[Anonymous], 2008, 907512008 ISO
[3]   FUNCTIONAL-DEPENDENCIES IN RELATIONS WITH NULL VALUES [J].
ATZENI, P ;
MORFUNI, NM .
INFORMATION PROCESSING LETTERS, 1984, 18 (04) :233-238
[4]   A Call to Arms: Revisiting Database Design [J].
Badia, Antonio ;
Lemire, Daniel .
SIGMOD RECORD, 2011, 40 (03) :61-69
[5]  
Bernstein P. A., 1976, ACM Transactions on Database Systems, V1, P277, DOI 10.1145/320493.320489
[6]  
Codd E. F., 1986, SIGMOD Record, V15, P53, DOI 10.1145/16301.16303
[7]  
Date C.J., 2009, SQL and Relational Theory: How to Write Accurate SQL Code, V1
[8]   Fast Set Intersection in Memory [J].
Ding, Bolin ;
Koenig, Arnd Christian .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 4 (04) :255-266
[9]   The Implication Problem of Data Dependencies over SQL Table Definitions: Axiomatic, Algorithmic and Logical Characterizations [J].
Hartmann, Sven ;
Link, Sebastian .
ACM TRANSACTIONS ON DATABASE SYSTEMS, 2012, 37 (02)
[10]   On Codd Families of Keys over Incomplete Relations [J].
Hartmann, Sven ;
Leck, Uwe ;
Link, Sebastian .
COMPUTER JOURNAL, 2011, 54 (07) :1166-1180