Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Anqing Teachers College(Natural Science Edition)》 2004-01
Add to Favorite Get Latest Update

Seeking for Relation Scheme Candidate Key by Using Functional Depending Graph

QIN Zun-yue, HU Hong-zhi, FENG Jun-song, CAI Guo-ming (The Computer and math. Dept.of Jishou University, Zhangjiajie, 427000,China)  
Seeking for candidate key of relation scheme is an important question in designing database theory. According to the graph theory, the paper firstly constructs a functional depending graph of relation scheme, then puts forth the relationship between the function depending and the candidate key. At last it provides the concrete method of seeking for algorithm for relation scheme candidate key by using both reverse adjacency list as its storing structure and BFS technology of graph.
【CateGory Index】: TP311.13
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
【References】
Chinese Journal Full-text Database 1 Hits
1 YANG Li-juan,ZHAO Mei-hong(School of Electronics & Information Engineering,SUST,Suzhou 215011,China);Evaluation to Candidate Keys to Relational Database[J];Journal of Suzhou University of Science and Technology(Natural Science Edition);2009-04
【Co-citations】
Chinese Journal Full-text Database 10 Hits
1 LIANG Wu -qi (School of Computer Science and Information Engineering,Hefei University of Technology,Hefei 230009,China);Analysis of Algorithm and Time Complexity on the Optimum Order of Matrix Chain Multiplication[J];Journal of Anhui TV University;2003-02
2 YU Binghui, WANG Kegang (The Computer Center; the Maths Department, Ankang Teachers' College, Ankang725000, Shaanxi, China);The Choice and Amelioration of Sorting Method[J];Journal of Ankang Teachers College;2004-04
3 YAN Ni (Ankang Vocation-Technology College,Ankang725000,Shaanxi,China);The Sample Teaching of Data-Structure in Vocational College[J];Journal of Ankang University;2008-02
4 QIN Zunyue (Maths & Computer science Department of Jishou University Zhangjiajie 427000 china);An Algorithm to Seek the Candidate Key of a Relation Scheme in the FD of the Left Single Attribute[J];Journal of Anqing Teachers College(Natural Science Edition);2003-02
5 DONG Ping(Mechanical & Electrical Engineering Department,Sanmenxia Polytechnic College,Sanmenxia 472000,China);The Improved Algorithm on the Quicksort and Recursion[J];Journal of Anyang Institute of Technology;2008-06
6 YANG Guang-xiang~1,TAO De-xin~1,HE Yan~2(1.School of Logistics Engineering,Wuhan University of Technology,Wuhan 430063,CHN;2.FiberHome Telecommunication Technologies CO.,Ltd,Wuhan 430080,CHN);Research and Simulation on SN Searching Algorithm in BPON System[J];Semiconductor Optoelectronics;2005-06
7 Cao Danyang Wei Jinqiang Li Jinhong Hu Jian(College of Information Engineering,North China Univ.of Tech.,100041,Beijing,China);Research on Application of Elective Course System Based on Credit System[J];Journal of North China University of Technology Beijing China;2006-01
8 HOU Liu_ping, LI Wei_sheng(School of Computer and Information Technology, Northern Jiaotong University, Beijing 100044,China);Minimum Spanning Tree Algorithm Based on Extended Double List Storage Structure[J];Journal of Northern Jiaotong University;2003-02
9 WANG\ Yongqun (National Key Laboratory for Text Processing,Institute of Computer Science and Technology,Peking University,Beijing,100871);The Model of the Database System Based on Structured Markup Language[J];ACTA SCICENTIARUM NATURALUM UNIVERSITIS PEKINESIS;1999-05
10 YANG Zhi-gang~1,MA Yun-peng~2,HU Chun-mei~3(1.Personnel Office,Capital Normal University,Beijing 100037,China;2.Great Wall Computer Software and System Limited Company,Beijing 100083,China;3.Teaching Affairs Office,Beijing Institute of Machinery,Beijing 100085,China);Discussion on the method of solving an intelligence game based on searching tree[J];Journal of Beijing Institute of Machinery;2006-01
China Proceedings of conference Full-text Database 6 Hits
1 YANG FENG1,JI KAI2,CHEN TAO-tao3,HAN DONG1(1.School of Resource and safety engineering,China University of mining and Technology(Beijing),Beijing 100083,China;2.Anhui Communication Vocational & Technical Colleague,Anhui,230051,China;3.School of Transportation of WHUT,Wuhan University of Technoloy,Hubei,430070,China);One Way For Optimal Public Traffic Route Choice[A];[C];2007
2 Liu Jinpeng Wei Changjiang (the College of Information Engineering,Qingdao University,Shandong 266071);An Efficient Implementation Method Of Shortest Path Algorithm Based On Heuristic Algorithm[A];[C];2008
3 He Hao Yang Yixian (Information Security Center of BUPT,Beijing,100876);A Time Management of SIM Based on Mass Storage of Short Message[A];[C];2008
4 Zhao Xi Yang Yixian Niu Xinxin (Digital Content Research Center,Key Laboratory of Information Processing and Intelligent Technology,Beijing University of Posts and Telecommunications,Beijing,100876);A Data Management Method Based On High Capacity Phone Book Of S IM[A];[C];2008
5 LIN He-ping,ZHOU Yan-jun,LI Yong-xu (College of Computer Science,Northeast Normal University,Changchun 130024,China);Threading-Binary-Tree[A];[C];2005
6 Xiong Jun Chen Yongzhou (Wuhan Research Institute of Post and Telecommunications,Wuhan 430074,China);Route Algorithm of Mesh-based Synchronous Network[A];[C];2008
【Co-references】
Chinese Journal Full-text Database 3 Hits
1 ZHANG Yong, GU Guo qing (College of Copmputing Engineering, Uninversity of Shanghai for Science and Technology, Shanghai 200093,China);Evaluation to Candidate Keys to Relational Model[J];Journal of Shanghai Institute & Electric Power;2002-01
2 LIAO Sa(Computer Dept.of Liuzhou Vocational & Technical College,Liuzhou,Guangxi,545006);Demonstration of The Theorem and Improvement of The Algorithm About Evaluating Candidate Keys of Relational Model[J];Journal of Liuzhou Vocational & Technical College;2005-01
3 JIANG Cui-xia(Information Science and Electronic Engineering Institute, Qiqihar University, Qiqihar 161006);The application of define the candidate key of a relation schema[J];Journal of Qiqihar University(Natural Science Edition);2003-04
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved