[ 收藏 ] [ 繁体中文 ]  
臺灣貨到付款、ATM、超商、信用卡PAYPAL付款,4-7個工作日送達,999元臺幣免運費   在線留言 商品價格為新臺幣 
首頁 電影 連續劇 音樂 圖書 女裝 男裝 童裝 內衣 百貨家居 包包 女鞋 男鞋 童鞋 計算機周邊

商品搜索

 类 别:
 关键字:
    

商品分类

數據庫設計與關繫理論(影印版)
該商品所屬分類:計算機/網絡 -> 數據庫
【市場價】
448-649
【優惠價】
280-406
【介質】 book
【ISBN】9787564138905
【折扣說明】一次購物滿999元台幣免運費+贈品
一次購物滿2000元台幣95折+免運費+贈品
一次購物滿3000元台幣92折+免運費+贈品
一次購物滿4000元台幣88折+免運費+贈品
【本期贈品】①優質無紡布環保袋,做工棒!②品牌簽字筆 ③品牌手帕紙巾
版本正版全新電子版PDF檔
您已选择: 正版全新
溫馨提示:如果有多種選項,請先選擇再點擊加入購物車。
*. 電子圖書價格是0.69折,例如了得網價格是100元,電子書pdf的價格則是69元。
*. 購買電子書不支持貨到付款,購買時選擇atm或者超商、PayPal付款。付款後1-24小時內通過郵件傳輸給您。
*. 如果收到的電子書不滿意,可以聯絡我們退款。謝謝。
內容介紹



  • 出版社:東南大學
  • ISBN:9787564138905
  • 作者:(英)戴特
  • 頁數:260
  • 出版日期:2013-01-01
  • 印刷日期:2013-01-01
  • 包裝:平裝
  • 開本:16開
  • 版次:1
  • 印次:1
  • 字數:338千字
  • 戴特(Data,C.J.)所著的《數據庫設計與關繫理論(影印版)》回答了如下問題:為什麼Heath定理如此重要?什麼是正交設計原則為什麼有些聯合檢測可以規約而另一些不行?依賴保持性有什麼作用?需要總是避免數據冗餘嗎?可能嗎?本書為你展示了如何使用重要的理論知識來創建良好的數據庫設計。
  • 是什麼讓這本書從數據庫設計的相關書籍中脫穎而出?很多討論設計實 踐的書籍很少講解內在理論知識,而討論設計理論的書籍卻又主要針對理論 工作者。在戴特(Data,C.J.)所著的《數據庫設計與關繫理論(影印版)》 中,著名專家C.J.Date以從業者可以理解的方式來講解設計理論,彌補了 前述的不足。該書以作者四十多年的經驗教訓總結而成,闡述了為什麼恰當 的設計在初始階段如此重要。 《數據庫設計與關繫理論(影印版)》的每一章都包含一組練習,它或者 展示了如何把理論知識應用到實踐中,或者提供了更多的信息,或者要求你 驗證一些簡單的理論結果。如果你非常熟悉數據庫的關繫模式,並且你希望 深入了解數據庫設計,那麼這本書就完全適合你。
  • Preface
    PART I SETTING THE SCENE
    Chapter 1 Preliminaries
    Some quotes from the literature
    A note on terminology
    The running example
    Keys
    The place of design theory
    Aims of this book
    Concluding remarks
    Exercises
    Chapter 2 Prerequisites
    Overview
    Relations and relvars
    Predicates and propositions
    More on suppliers and parts
    Exercises
    PART II FUNCTIONAL DEPENDENCIES, BOYCE/CODD NORMAL FORM,
    AND RELATED MATTERS
    Chapter 3 Normalization: Some Generalities
    Normalization serves two purposes
    Update anomalies
    The normal form hierarchy
    Normalization and constraints
    Concluding remarks
    Exercises
    Chapter 4 FDs and BCNF (Informal)
    First normal form
    Functional dependencies
    Keys rex, isited
    Second normal form
    Third normal form
    Boyce/Codd normal form
    Exercises
    Chapter 5 FDs and BCNF (Formal)
    Preliminary definitions
    Functional dependencies
    Boyce/Codd normal form
    Heath's Theorem
    Exercises
    Chapter 6 Preserving FDs
    An unfortunate conflict
    Another example
    ... And another
    ... And still another
    A procedure that works
    Identity decompositions
    More on the conflict
    Independent projections
    Exercises
    Chapter 7 FD Axiomatization
    Armstrong's axioms
    Additional rules
    Proving the additional rules
    Another kind of closure
    Exercises
    Chapter 8 Denormalization
    "Denormalize for performance"?
    What does denormalization mean?
    What denormalization isn't (I)
    What denormalization isn't (II)
    Denormalization considered harmful (I)
    Denormalization considered harmful (II)
    A final remark
    Exercises
    PART III JOIN DEPENDENCIES, FIFTH NORMAL FORM,
    AND RELATED MATTERS
    Chapter 9 JDs and 5NF (Informal)
    Join dependencies--the basic idea
    A relvar in BCNF and not 5NF
    Cyclic rules
    Concluding remarks
    Exercises
    Chapter 10 JDs and 5NF (Formal)
    Join dependencies
    Fifth normal form
    JDs implied by keys
    A useful theorem
    FDs aren't JDs
    Update anomalies revisited
    Exercises
    Chapter 11 Implicit Dependencies
    Irrelevant components
    Combining components
    Irreducible JDs
    Summary so far
    The chase algorithm
    Concluding remarks
    Exercises
    Chapter 12 MVDs and 4NF
    An introductory example
    Multivalued dependencies (informal)
    Multivalued dependencies (formal)
    Fourth normal form
    Axiomatization
    Embedded dependencies
    Exercises
    Chapter 13 Additional Normal Forms
    Equality dependencies
    Sixth normal form
    Superkey normal form
    Redundancy free normal form
    Domain-key normal form
    Concluding remarks
    Exercises
    PART IV ORTHOGONALITY
    Chapter 14 The Principle of Orthogonal Design
    Two cheers for normalization
    A motivating example
    A simpler example
    Tuples vs. propositions
    The firstexample revisited
    The second example revisited
    The final version
    A clarification
    Concluding remarks
    Exercises
    PART V REDUNDANCY
    Chapter 15 We Need More Science
    A little history
    Database design is predicate design
    Example 1
    Example 2
    Example 3
    Example 4
    Example 5
    Example 6
    Example 7
    Example 8
    Example 9
    Example 10
    Example 11
    Example 12
    Managing redundancy
    Refining the definition
    Concluding remarks
    Exercises
    APPENDIXES
    Appendix A Primary Keys Are Nice but Not Essential
    Arguments in favor of the PK:AK distinction
    Relvars with more than one key
    The invoices and shipments example
    One primary key per entity type?
    The applicants and employees example
    Concluding remarks
    Appendix B Redundancy Revisited
    Appendix C Historical Notes
    Appendix D Answers to Exercises
    Chapter 1
    Chapter 2
    Chapter 3
    Chapter 4
    Chapter 5
    Chapter 6
    Chapter 7
    Chapter 8
    Chapter 9
    Chapter 10
    Chapter 11
    Chapter 12
    Chapter 13
    Chapter 14
    Chapter 15
    Index
 
網友評論  我們期待著您對此商品發表評論
 
相關商品
在線留言 商品價格為新臺幣
關於我們 送貨時間 安全付款 會員登入 加入會員 我的帳戶 網站聯盟
DVD 連續劇 Copyright © 2024, Digital 了得網 Co., Ltd.
返回頂部