Database design theory
著者
書誌事項
Database design theory
(Macmillan computer science series)
Macmillan, 1992
- タイトル別名
-
Structures des bases de données
大学図書館所蔵 全10件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Bibliography: p. 249-256
Includes index
内容説明・目次
内容説明
The chief aim of this book is to establish a theoretical basis of database design, focusing in particular on the relational database as model. The book is divided into four parts. The chapters of Part 1 introduce the concepts required for the modelling of data. Part 2 examines the problems encountered when embarking on a design and puts forward some solutions for transforming the relational model of an application into an internal data structure. Part 3 tackles more complex problems, such as data redundancy, integrity rules and cyclic data structures. Here, the solutions put forward lead to operational results that are founded on known mechanisms, such as the decomposition of a relation, but also on new mechanisms which are described in part 4.
目次
- Part 1 Data modelling: a relational data model
- concepts of the relational data model, operations defined on a set of relations, normal operations defined on a set of instances, synthesis - data dictionary, example - production workshop, integrity rules
- integrity rule, introduction to dependencies, functional and dimensional dependencies, join and decomposition dependencies, inclusion dependencies, relation cycles, other integrity rules, table of ir ranges. Part 2 Transformations: introduction and access paths graph
- choice of an internal data model, accuracy of an internal structure, access paths graph, relation graph, join of embedded relations, plan of the second part, transformation of a decomposition into a relation graph, relation graph of a decomposition, use of hinges, from a relation graph to an internal data structure
- choice of an access paths graphs, computing methods of embedding access paths. Part 3 Decomposition of a relation: choosing a relation decomposition
- decomposing a relation, projection and extension of an integrity rule, qualities of a decomposition, choice crieria for a functional decomposition
- introduction, problems encountered, structural elements, a solution - mechanisms for completeness of keys and entities, basic decomposition
- introduction, keys to a relation, minimum fd equivalence classes, block of attributes and groups of fds, invariance of non-redundant bases, homogenous coverings and the basic covering, homogenous decompositions and the basic decomposition of a relation, completely homogenous decomposition, relation graph of a completely homogenous decomposition, FD appendix, Appendix: damping functional cycles
- damping a functional cycle, validation of a damping. Part 4 Perspectives: perspectives
- design process for databases, extended relational data model, control mechanisms, Appendix: use of this mechanism.
「Nielsen BookData」 より