第五章 关系数据理论(The fifth chapter relational data theory).docVIP

第五章 关系数据理论(The fifth chapter relational data theory).doc

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
第五章 关系数据理论(The fifth chapter relational data theory)

第五章 关系数据理论(The fifth chapter relational data theory) The fifth chapter is relational data theory First, the multiple-choice question 1., in order to design a better relational model, we must standardize and standardize it. The main theoretical basis is (). A. relation normalization theory B. relational algebra theory C. mathematical logic, D. relation, operation theory 2., the theory of normalization is the theoretical basis for logical design of relational databases. According to this theory, relations in relational databases must be satisfied: each attribute is (). A. whose length is constant; B. is not decomposable C. interrelated, D., uncorrelated 3. known relational patterns R (A, B, C, D, E) and their functional dependency sets F = {A = D, B = C, E = A}, the candidate key for this relational schema is (). A.AB B. BE C.CD D. DE 4. students between S (SNO, SNAME, SSEX, SAGE, SDPART) of the primary key SNO, student relationship between SC (SNO, CNO, SCORE) key for SNO and CNO, then the relationship between R (SNO, CNO, SSEX, SAGE, SDPART, SCORE) key for SNO and CNO, to meet the (). A. 1NF B.2NF C. 3NF D. BCNF 5. with W (C, P model, S, G, T, R), in which the attribute meaning is: C courses, P said S said the teacher, students, G scores, T said, R said, according to the semantic dependency set has the following data: D={(C, P, S, C, G), (T, R), C (T, P), R (T, S) - R}, a keyword relationship model W is (). A. (S, C) B. (T, R) C. (T, P) D. (T, S) In the 6. relational schema, the schema that satisfies 2NF (). A. may be 1NF, B. must be 1NF C. must be 3NF, and D. must be BCNF 7., the attributes in the relational schema R are all primary attributes, and the highest paradigm of R must be (). A. 1NF B. 2NF C. 3NF D. BCNF 8., the 1NF relational schema that removes some of the functional dependencies must be (). A. 1NF B. 2NF C. 3NF D. BCNF 9. if AB, then A attribute and attribute of B is (). A. one to many, B. to many to one C. is many to many, D. is not above The candidat

您可能关注的文档

文档评论(0)

jgx3536 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

版权声明书
用户编号:6111134150000003

1亿VIP精品文档

相关文档