.tabbox {width:400px; margin-top: 15px;margin-bottom: 5px} .tabmenu {width:400px;height:28px;border-left:1px solid #CCC;border-top:1px solid #ccc;} .tabmenu ul {margin:0;padding:0;list-style-type: none;} .tabmenu li { text-align:center; float:left; display:block; width:99px; overflow:hidden; background-color: #f1f1f1; line-height:27px; border-right:#ccc 1px solid; border-bottom:#ccc 1px solid; display:inline;} .tabmenu .cli {text-align:center;float:left;display:block;width:99px;overflow:hidden;background-color: #fff;line-height:27px;border-right:#ccc 1px solid;border-bottom:#fff 1px solid;display:inline; cursor:pointer; color: #810505; font-weight:bold} #tabcontent {width:399px;background-color:#fff;border-left:#CCC 1px solid;border-right:#CCC 1px solid;border-bottom:#CCC 1px solid; height:60px;} #tabcontent ul {margin:0;padding:5px;list-style-type: none;} #tabcontent .hidden {display:none;} Search Browse by Issue Fig/Tab Adv Search
 HOME ABOUT JCST AUTHORS REVIEWERS PUBLISHED PAPERS FORTHCOMING PAPERS

• Articles •

### Polynomial Tests of Normal Forms and Some Related Results

Wang Ke;

1. Department of Computer Science Chongqing University; Chongqing;
• Online:1992-01-10 Published:1992-01-10

The following problem is called the everywhere-cover problem:“Given a set of dependencies over a database scheme,is the set of dependencies explicitly given for each relation scheme equivalent to the dependencies implied for that relation scheme?”It is shown that when the everywhere-cover problem has a ‘yes’ answer,examining only the dependencies explicitly given will suffice to test 3NF,BCNF and 4NF of a database scheme.But this does not hold for 2NF.Consequently,in such cases,tests of BCNF and 4NF all tak…

 [1] E.F.Codd, A relational model for large shared data banks. CACM, 1970, 13(6), 377-387. [2] E.F.Codd, Further normalization of the data base relational model. Data Base Systems (R.Rustin,ed.), 1972, 33-64. [3] R.Fagin, Multivalued dependencies and a new normal form for relational databases. ACM TODS, 1977, 2 (3), 262-278. [4] R.Fagin, The decomposition versus synthetic approach to relational database design. VLDB, 1977, 441-446. [5] D.Maicr, The theory of relational databases. CSP, Inc., 1983. ……….
 No related articles found!
Viewed
Full text

Abstract

Cited

Shared
Discussed
 [1] Xu Qingyun; Wang Nengbin;. Concurrency Control Mechanism of Complex Objects[J]. , 1992, 7(4): 305 -310 . [2] Jin Guohua; Yang Xuejun; Chen Fujie;. Loop Staggering,Loop Compacting:Restructuring Techniques for Thrashing Problem[J]. , 1993, 8(1): 49 -57 . [3] Zeng Jianchao; Hidehilio Sanada; Yoshikazu Tezuka;. A Form Evaluation System and Its Data Structure for Brush-Written Chinese Characters[J]. , 1995, 10(1): 35 -41 . [4] Chi-Ming CHUNG; Ding-An CHIANG; YANG Qing;. A Comparative Analysis of Different Arbitration Protocols for Multiple-Bus Multiprocessors[J]. , 1996, 11(3): 313 -325 . [5] Xu Shiyi; G.P.Dias;. The Methodology of Testability Prediction for Sequential Circuits[J]. , 1996, 11(6): 529 -541 . [6] Sun Jizhou; Richard L;. A Radiosity Solution for Curved Surface Environments[J]. , 1997, 12(5): 414 -424 . [7] Chen Yangjun;. Counting and Topological Order[J]. , 1997, 12(6): 497 -509 . [8] Jia-Hai Yang, Senior Member, CCF, Member, IEEE, Hui Zhang, Member, ACM, IEEE, Jin-Xiang Zhang, and Chang-Qing An. Towards Next Generation Internet Management: CNGI-CERNET2 Experiences[J]. , 2009, 24(3): 482 -494 . [9] Wei Jiang (姜伟), Tian Wu (吴甜), Song-Lin Hu (虎嵩林), Senior Member, CCF, and Zhi-Yong Liu (刘志勇), Senior Member, CCF. QoS-Aware Automatic Service Composition: A Graph View[J]. , 2011, 26(5): 837 -853 . [10] Shi-Min Hu, Leif Kobbelt. Preface[J]. , 2015, 30(3): 437 -438 .
 ISSN 1000-9000(Print)          1860-4749(Online) CN 11-2296/TP Home Editorial Board Author Guidelines Subscription Journal of Computer Science and Technology Institute of Computing Technology, Chinese Academy of Sciences P.O. Box 2704, Beijing 100190 P.R. China Tel.:86-10-62610746 E-mail: jcst@ict.ac.cn