AN ALMOST LINEAR-TIME ALGORITHM FOR COMPUTING A DEPENDENCY BASIS IN A RELATIONAL DATABASE

被引:46
作者
GALIL, Z [1 ]
机构
[1] IBM CORP,RES LAB,SAN JOSE,CA 95114
关键词
D O I
10.1145/322290.322296
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
引用
收藏
页码:96 / 102
页数:7
相关论文
共 9 条
[1]  
Beeri C., 1979, ACM Transactions on Database Systems, V4, P30, DOI 10.1145/320064.320066
[2]  
Beeri C., 1980, ACM Transactions on Database Systems, V5, P241, DOI 10.1145/320613.320614
[3]  
BEERI C, 1979, 43 HEBR U DEP COMP S
[4]  
Fagin R., 1977, ACM Transactions on Database Systems, V2, P262, DOI 10.1145/320557.320571
[5]   DECISION PROBLEMS FOR MULTIVALUED DEPENDENCIES IN RELATIONAL DATABASES [J].
HAGIHARA, K ;
ITO, M ;
TANIGUCHI, K ;
KASAMI, T .
SIAM JOURNAL ON COMPUTING, 1979, 8 (02) :247-264
[6]  
Knuth Donald E, 1968, ART COMPUTER PROGRAM, V1
[7]   AN EQUIVALENCE BETWEEN RELATIONAL DATABASE DEPENDENCIES AND A FRAGMENT OF PROPOSITIONAL LOGIC [J].
SAGIV, Y ;
DELOBEL, C ;
PARKER, DS ;
FAGIN, R .
JOURNAL OF THE ACM, 1981, 28 (03) :435-453
[9]  
ULLMAN JD, 1980, PRINCIPLES DATABASE