## 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. |

### Other editions - View all

### Common terms and phrases

Acyclic algebraic expression algorithm Arm(F attr axiom system bath BCNF boolean function calculus expression Codd tables Computer condition Consider contains database constraints database instance database scheme Database Systems decomposing decomposition steps define Definition deletion denoted dom(A domain equivalent Example fds and mvds fifth normal form Figure flat relation instance FLOOR fourth normal form functional dependencies Hence hierarchical instances holds horizontal decomposition hypergraph II(r implication problem 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 r₁ reduced relational algebra Relational Database ROOM-NUMBER ROOMMAID-NUMBER roommaids satisfies the mvd scheme expression set of attributes set of constraints set of fds set of tuples SQL query subschemes superkey tableau Theorem third normal form true tuple calculus updates V-tables VIS-NUMBER visitor weak instance XPLUS