最 低 价：￥26.00
| C．J．Date 1962年、1966年在英国剑桥大学获得数学学士，硕士学位，1994年在英国Montfort大学获得博士学位。他是关系数据库系统方面非常著名的独立撰稿人、学者、研究者和顾问，是最早认识到Codd在关系模型方面所做的开创性贡献的学者之一，参与了IBM产品(SQL／DS和DB2)的技术规划。Date发表了300多篇数据库方面的技术性文章和研究论文，对数据库理论的发展做出了巨大的贡献。特别是《数据库系统导论》一书，这是数据库领域的标准教材，已在全球发行了近75万册。. Hugh Darwen 1967～2004年间一直在.. << 查看详细 |
| preface . vii part i preliminaries chapter 1 background and overview the third manifesto back to the relational future some guiding principles some crucial logical differences concluding remarks exercises chapter 2 a survey of the relational model the running example tuples relations relation variables relvars, relations, and predicates integrity constraints relational operators virtual relvars the relational model exercises .chapter 3 toward a theory of types values are typed types vs. representations scalar vs. nonsealar types possible representations selectors and the_ operators system-defined types operators type generators concluding remarks exercises part ii formal specifications chapter 4 the third manifesto rm prescriptions rm proscriptions oo prescriptions oo proscriptions rm very strong suggestions oo very strong suggestions recent manifesto changes chapter 5 tutorial d common constructs scalar definitions tuple definitions relational definitions scalar operations tuple operations relational operations relations and arrays statements recent language changes a remark on syntax exercises part iii informal discussions and explanations chapter 6 rm prescriptions rm prescription 1: scalar types rm prescription 2: scalar values are typed rm prescription 3: read-only vs. update operators rm prescription 4: physical vs. possible representations rm prescription 5: expose possible representations rm prescription 6: type generator tuple rm prescription 7: type generator relation rm prescription 8: equality rm prescription 9: tuples rm prescription 10: relations rm prescription 11: scalar variables rm prescription 12: tuple variables rm prescription 13: relation variables (relvars) rm prescription 14: kinds of relvars rm prescription 15: candidate keys rm prescription 16: databases rm prescription 17: transactions rm prescription 18: relational algebra rm prescription 19: relvar names, relation selectors, and recursion rm prescription 20: user-defined tuple and relational operators rm prescription 21: assignments rm prescription 22: comparisons rm prescription 23: integrity constraints rm prescription 24: total database constraints rm prescription 25: catalog rm prescription 26: language design exercises chapter 7 rm proscriptions rm proscription 1: no attribute ordering rm proscription 2: no tuple ordering rm proscription 3: no duplicate tuples rm proscription 4: no nulls rm proscription 5: no nullologicat mistakes rm proscription 6: no internal-level constructs rm proscription 7: no tuple-level operations rm proscription 8: no composite attributes rm proscription 9: no domain check override rm proscription 10: not sql exercises chapter 8 oo prescriptions oo prescription 1: compile-time type checking oo prescription 2: type inheritance (conditional) oo prescription 3: computational completeness oo prescription 4: explicit transaction boundaries oo prescription 5: nested transactions oo prescription 6: aggregate operators and empty sets exercises chapter 9 oo proscriptions oo proscription 1: relvars are not domains oo proscription 2: no object ids exercises chapter 10 rm very strong suggestions rm very strong suggestion 1: system keys rm very strong suggestion 2: foreign keys rm very strong suggestion 3: candidate key inference rm very strong suggestion 4: transition constraints rm very strong suggestion 5: quota queries rm very strong suggestion 6: generalized transitive closure rm very strong suggestion 7: user-defined generic operators rm very strong suggestion 8: sql migration exercises .. chapter 11 oo very strong suggestions oo very strong suggestion 1: type inheritance oo very strong suggestion 2: types and operators unbundled oo very strong suggestion 3: single-level store exercises part iv subtyping and inheritance chapter 12 preliminaries toward a type inheritance model single vs. multiple inheritance scalars, tuples, and relations the running example concluding remarks exercises chapter 13 the inheritance model im prescriptions recent inheritance model changes chapter 14 single inheritance with scalar types im prescription 1: types are sets im prescription 2: subtypes are subsets im prescription 3: "subtype of" is reflexive im prescription 4: proper subtypes im prescription 5: "subtype of" is transitive im prescription 6: immediate subtypes im prescription 7: root types disjoint im prescription 8: scalar values with inheritance im prescription 9: scalar variables with inheritance im prescription 10: specialization by constraint im prescription 11: assignment with inheritance im prescription 12: bquality etc. with inheritance im prescription 13: join etc. with inheritance im prescription 14: treat im prescription 15: type testing im prescription 16: read-only operator inheritance and value substitutability im prescription 17: operator signatures im prescription 18: read-only parameters to update operators im prescription 19: update operator inheritance and variable substitutability im prescription 20: union, dummy, and maximal and minimal types exercises chapter 15 multiple inheritance with scalar types an introductory example type graphs least specific types unique most specific types unique remarks on operator inheritance exercises chapter 16 inheritance with tuple and relation types im prescription 21: tuple/relation subtypes and supertypes im prescription 22: tuple/relation values with inheritance im prescription 23: maximal and minimal tuple/relation types im prescription 24: tuple/relation most specific types im prescription 25: tuple/relation variables with inheritance some implications of im prescriptions 21-25 exercises appendixes appendix a a new relational algebra motivation and justification remove, rename, and compose treating operators as relations formal definitions how tutorial d builds on a appendix b a design dilemma? encapsulation discussion further considerations appendix c types and units type definition selectors the_ operators computational operators display operators type constraints a more complex example appendix d what is a database? updating the database databases vs. tuples appendix e view updating date's appoach assumptions and notation a closer look at relational assignment a model of updating a closer look at constraints updating restrictions updating intersections updating unions updating differences nested updates updating extensions updating joins updating projections some remarks on orthogonality a remark on multiple assignment summary darwen's approach appendix f a closer look at specialization by constraint the 3 out of 4 "rule" what does inheritance really mean? benefits of s by c what about objects? implementation considerations appendix g a closer look at structural inheritance an introductory example tuple types, values, and variables subtables and supertables scalar types revisited structural inheritance with fewer tears appendix h a comparison with sql rm prescriptions rm proscriptions oo prescriptions oo proscriptions rm very strong suggestions oo very strong suggestions im prescriptions appendix i a grammar for tutorial d appendix j references and bibliography index ... |
内容加载中，请稍后...
商品评论（0条）