The structure of the relational database model

From MaRDI portal





The book covers the most fundamental issues concerning relational databases. It is distinguished among the many books by a rigorous formal approach and a sharp focus on the practical aspects of the subject. The material is organized into 8 chapters. Chapter 1 presents the most basic notions of the relational model (relations, relational schemes, relational instances, database schemes, database instance, dynamic schemes evolutions, constraints). A detailed example scheme concludes the chapter. Chapter 2 deals with query languages. The relational algebra, the tuple calculus and (a subset of) SQL is described in detail. An informal description (aided by carefully selected examples) of the languages is followed by syntax diagrams. The expressive power and in particular the equivalence of the three approaches is also addressed. An overview of the most important (static) constraints is given in Chapter 3. The material on functional and multivalued dependencies is complemented by sections on join, inclusion, tuple generating and equality generating dependencies. Considerable attention is devoted to algorithmic issues. Normal forms and the corresponding vertical decompositions are treated in Chapter 4. The central result is the synthesis algorithm for constructing contraint preserving decompositions into third normal form. Problems related to consistency checking are also considered. Chapter 5 introduces an interesting way of exception handling, the horizontal decompositions. The exceptions considered are formalized using functional dependencies. Formal properties of functional dependencies are discussed and normal forms for horizontal decompositions are introduced. Incomplete information is the subject of Chapter 6. The types of null values are considered (existing but unknown, non-existing, no- information). Representation systems are introduced for each of the above null values. Some issues related to updates and constraints of incomplete databases are discussed. A section on the weak instance model concludes the chapter. The nested relational model is covered in Chapter 7. This is a model which allows one to treat hierarchically organized data in a relational framework and in particular permits the use of expressive, relational- like query languages, such as the nested relational algebra described here. Some other aspects of (flat) relational databases (e.g. constraints) are also generalized to this model. Chapter 8 studies the effects of series of updates on a databse. The transactions discussed are sequences of insertions, deletions and modifications. The central topic is the equivalence of such transactions. There are nice problem sets at the end of each chapter.





Cited in
(59)








This page was built for publication: The structure of the relational database model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3992720)