Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Jiangxi Normal University (Natural Sciences Edition)》 1994-01
Add to Favorite Get Latest Update

The Number of Candidate Keys in Relation Scheme

Zhou Dingkang (Dept.of Computer Sci.of Jiangxi Normal Univevsity,Nanchang 330027)  
In this paper. the number of candidate keys, the relationship among number of candidate keys, attributes, function dependencies and the maxinum of candides keys were researched in the relation scheme.
【CateGory Index】: TP311.13
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【Citations】
Chinese Journal Full-text Database 3 Hits
1 Zhou Dingkang (Dept.of Computer Science);The Algorithm for Solving All Candidate Keys of Relation Schema Based on Topological Squence Structure[J];Journal of Jiangxi Normal University(Natural Sciences Edition);1992-04
2 Zhou Dingkang Computer Science Department of Jiangxi Normal University,Nanehang,330027;Strong Functional Dependencies and Partial Ordering Structure[J];Journal of Computer Research and Development;1993-04
3 Zhou Dingkang(Computer Science Department, Jiangxi Normal University, Nancnang 330027);THEORY FOR DETERMINING CANDIDATE KEYS[J];Chinese Journal of Computers;1992-04
【Co-citations】
Chinese Journal Full-text Database 8 Hits
1 Zhou Dingkang (Dept.of Computer Science);The Algorithm for Solving All Candidate Keys of Relation Schema Based on Topological Squence Structure[J];Journal of Jiangxi Normal University(Natural Sciences Edition);1992-04
2 Zhou Dingkang (Dept,of Computer Science);Both Hands Meta Primary Attribute[J];Journal of Jiangxi Normal University(Natural Sciences Edition);1993-03
3 Zhou Dingkang (Dept. of Computer);The Theorem and Algorithm for Solving All Candidate Keys of Relation Schema[J];Journal of Jiangxi Normal University(Natural Sciences Edition);1993-04
4 Zhou Dingkang Computer Science Department of Jiangxi Normal University,Nanehang,330027;Strong Functional Dependencies and Partial Ordering Structure[J];Journal of Computer Research and Development;1993-04
5 Zhou Dingkang(Computer Science Department, Jiangxi Normal University, Nanchang, 330027);A New Method for Simplifying Relation Schema With Keeping Equal Candidate Keys by Successive Elimination[J];JOURNAL OF COMPUTER RESEARCH AND DEVELOPMENT;1995-05
6 Zhou Dingkang(Department of Computer Science, Jiangxi Normal University,Nanchang 330027);REPLACING ALGORITHM FOR FINDING ALL CANDIDATE KEYS OF RELATIONAL SCHEME AND THE PROOF OF ITS CORRECTNESS AND COMPLETENESS[J];CHINESE JOURNAL OF COMPUTERS;1994-10
7 Zhou Dingkang(Department of Compuer Science,Jiangxi Normal Uniuersity.Nanchang 330027);TRANSFORMATION THEORY OF RELATION SCHEME WITH KEEPING EQUAL CANDIDATE KEYS[J];CHINESE JOURNAL OF COMPUTERS;1995-10
8 LI Tianqing, ZHANG Yi, SONG Jingyan, HU Dongcheng(Department of Automation, Tsinghua University, Beijing 100084, China);Standardized algorithm of relation scheme for hypergraph database[J];Journal of Tsinghua University(Science and Technology);2001-03
【Secondary Citations】
Chinese Journal Full-text Database 2 Hits
1 Feng Yucai(Huazhong University of Science and Technology);ALGORITHM FOR SOLVING CANDIDATE KEY BY GRAPH THEORY[J];Chinese Journal of Computers;1988-09
2 Zhou Dingkang(Computer Science Department, Jiangxi Normal University, Nancnang 330027);THEORY FOR DETERMINING CANDIDATE KEYS[J];Chinese Journal of Computers;1992-04
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved