Database Design Theory

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.