The structure of the relational database model
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.
- Charting the completeness frontier of inference systems for multivalued dependencies
- Axiomatizing functional dependencies in the higher-order entity-relationship model
- The problem of incomplete information in relational databases
- Functional dependencies in relational databases: A lattice point of view
- The number of keys in relational and nested relational databases
- Hereditarily-finite sets, data bases and polynomial-time computability
- Unique complements and decompositions of database schemata
- Decomposing constraint satisfaction problems using database techniques
- Extended nested relations
- CGOOD, a categorical graph-oriented object data model
- A deontic approach to database integrity
- Complex object multi-level fixpoint queries.
- Characterization of desirable properties of general database decompositions.
- Foundations of entity-relationship modeling
- Query languages for bags and aggregate functions
- Constrained dependencies
- Insertion anomalies and the justification for 4NF in relational databases
- Datalog extension for nested relations
- Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets
- Reasoning about functional and full hierarchical dependencies over partial relations
- Characterising nested database dependencies by fragments of propositional logic
- The complexity of embedded axiomatization for a class of closed database views
- Functional and multivalued dependencies in nested databases generated by record and list constructor
- Database scheme design for clinical studies based on a semantic data model
- Characterization of optimal complements of database views defined by projection
- Objects in relational database schemes with functional, inclusion, and exclusion dependencies
- Some remarks on relational database schemes having few minimal keys
- Foundations for a fourth normal form over SQL-like databases
- scientific article; zbMATH DE number 3843177 (Why is no real title available?)
- Relational Databases
- scientific article; zbMATH DE number 3856446 (Why is no real title available?)
- scientific article; zbMATH DE number 3915665 (Why is no real title available?)
- Database Schema Design In The Relational Model
- scientific article; zbMATH DE number 3961016 (Why is no real title available?)
- scientific article; zbMATH DE number 3976396 (Why is no real title available?)
- scientific article; zbMATH DE number 4035217 (Why is no real title available?)
- A domain theoretic characterisation of the universal relation
- scientific article; zbMATH DE number 42986 (Why is no real title available?)
- scientific article; zbMATH DE number 41085 (Why is no real title available?)
- The unnormalized relational data model. For office form processor design
- scientific article; zbMATH DE number 53099 (Why is no real title available?)
- scientific article; zbMATH DE number 108396 (Why is no real title available?)
- A guided tour of relational database and beyond
- Information-based distance measures and the canonical reflection of view updates
- Characterisations of multivalued dependency implication over undetermined universes
- On functional dependencies in advanced data models
- Rough sets in incomplete information systems with order relations under Lipski's approach
- scientific article; zbMATH DE number 5593358 (Why is no real title available?)
- Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes
- Information-Optimal Reflections of View Updates on Relational Database Schemata
- Semantics in Data and Knowledge Bases
- Semantic Bijectivity and the Uniqueness of Constant-Complement Updates in the Relational Context
- Simulation of the nested relational algebra by the flat relational algebra, with an application to the complexity of evaluating powerset algebra expressions
- The Choice Construct in the Soufflé Language
- Modular SAT-based techniques for reasoning tasks in team semantics
- Relational schemas with multiplicity bounds, diversity bounds and functional dependencies
- The flattening operator in team-based logics
- Deciding implication for functional dependencies in complex-value databases
- On a hierarchy of classes for nested databases
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)