## The Structure of the Relational Database ModelSpringer Science & Business Media, 2012 M12 6 - 233 pages This book presents an overview of the most fundamental aspects of the theory that underlies the Relational Database Model. As such it is self-contained though experience with formal models and abstract data manipulating on the one hand and with the practical use of a relational system on the other hand can help the reader. Such experience will offer the reader a better understanding of and a motivation for the different concepts, theories and results mentioned in the book. We have focussed on the most basic concepts and aspects of the relational model, without trying to give a complete overview of the state of the art of database theory. Recently a lot of books on databases in general and on the relational model in particular have been published. Most of them describe the use of database systems. 'Some clarify how information has to be structured and organized before it can be used to build applications. Others help the user in writing down his applications or in finding tricky ways to optimize the running time or the necessary space. Another category of books treat more fundamental and more general aspects such as the description of the relational model, independent of any implementation, the decomposition in normal forms or the global design of distributed databases. Few, however, are the books that describe in a formal way some of the subjects mentioned above. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

Query Systems | 19 |

Constraints | 61 |

Vertical Decompositions | 113 |

Horizontal Decompositions | 132 |

Incomplete Information | 156 |

The Nested Relational Database Model | 177 |

Updates | 202 |

220 | |

228 | |

### Other editions - View all

### Common terms and phrases

algorithm attr augmented attributes axiom system BATH2 BCNF boolean function calculus expression Chapter Codd tables condition Consider contains database constraints database instance database scheme decomposing decomposition steps define Definition Del(C deletion denoted DOM(A domain Example fifth normal form Figure flat relation instance FLOOR fols fourth normal form functional dependencies Hence hierarchical instances holds horizontal decomposition II(r implication problem implied join dependency Lemma Let PRS multivalued dependencies mvds nested algebra nested relation instance nested relation scheme NEWD null-values nulls NUMBER-OF-BEDS possible relation instance primitive relation scheme projection proof reduced relational algebra room number ROOM-NUMBER ROOMMAID-NUMBER roommaids scheme expression scheme Q second normal form set of attributes set of constraints set of fas set of tuples SQL query subschemes superkey tableau Theorem third normal form Transaction Ti(r true tuple calculus updates V-tables VIS-NUMBER visitor weak instance XPLUS