scientific article; zbMATH DE number 108405
The book presents the theory and practice of database design. It develops the theory explaining the properties of good database schemas, and shows how good schemas can be designed using the entity-relationship model and the relational database model. The book consists of four parts. The first part is an introduction into database design. It presents basic definitions of data models, and discusses the properties a good database design should have. The entity-relationship model is the semantic data model used in the book. The semantics of the entity-relationship is described. The first part provide more advice on how the modelling concepts should be used to obtain a database schema that can be used without problems. The basic concepts of the relational model and also two query languages are defined. The book describes the basic concepts of the object-oriented data models too and discusses thier connection to the relational model. The book provides an intuitive motivation for some general design principles which to a certain degree are always applicable, no matter what data model is used. The second part concentrates on the relational model. It discusses different types of integrity constraints, studies the properties of integrity constraints and gives the axiomatizations for the important classes of functional and inclusion dependencies. The third part gives algorithms for mapping an entity-relationship diagram into a relational schema and vice versa. The fourth part defines concepts it can be used in producing fast algorithms for traditional design problems and also for generating example databases. The design methods explored within the book have been implemented within ``Design By Example, a tool developed by the authors. Altogether it is a useful book for an undergraduate or postgraduate course in database design.
- Design of logical database structure for data handling systems
- Interactive relational database design. A logic programming implementation
- A logical design method for relational databases based on generalization and aggregation semantics
- Asymptotic properties of keys and functional dependencies in random databases
- On functional dependencies in q-Horn theories
- Lattices, closures systems and implication bases: a survey of structural aspects and algorithms
- Minimal-change integrity maintenance using tuple deletions
- Characterizing approximate-matching dependencies in formal concept analysis with pattern structures
- A relational database system architecture based on a vector-processing method
- Consistency problems in ER-schemas for database systems
- Horn approximations of empirical data
- Translating between the representations of a ranked convex geometry
- Optimizations in computing the Duquenne-Guigues basis of implications
- Functional dependencies are helpful for partial materialization of data cubes
- Attribute-incremental construction of the canonical implication basis
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
- Performance model of database relationship to design and manufacturing
- Database Repairing and Consistent Query Answering
- Using meta-structures in database design
- Understanding database design expertise
- scientific article; zbMATH DE number 986443 (Why is no real title available?)
- Reasoning methods for designing and surveying relationships described by sets of functional constraints
- Some remarks on relational database schemes having few minimal keys
- BCNF via attribute splitting
- scientific article; zbMATH DE number 3904003 (Why is no real title available?)
- Database Schema Design In The Relational Model
- A logical design methodology for relational databases using the extended entity-relationship model
- scientific article; zbMATH DE number 4057061 (Why is no real title available?)
- scientific article; zbMATH DE number 4070291 (Why is no real title available?)
- scientific article; zbMATH DE number 49428 (Why is no real title available?)
- scientific article; zbMATH DE number 52306 (Why is no real title available?)
- scientific article; zbMATH DE number 53077 (Why is no real title available?)
- scientific article; zbMATH DE number 54049 (Why is no real title available?)
- scientific article; zbMATH DE number 54058 (Why is no real title available?)
- Discovering functional and inclusion dependencies in relational databases
- Autonomous sets for the hypergraph of all canonical covers
- scientific article; zbMATH DE number 575380 (Why is no real title available?)
- scientific article; zbMATH DE number 730337 (Why is no real title available?)
- Functional and approximate dependency mining: database and FCA points of view
- Tableaux for functional dependencies and independencies
- Semistructured database design.
- Framework design of a domain-key schema of a relational database
- scientific article; zbMATH DE number 2173820 (Why is no real title available?)
- scientific article; zbMATH DE number 3992948 (Why is no real title available?)
- scientific article; zbMATH DE number 779275 (Why is no real title available?)
- scientific article; zbMATH DE number 859450 (Why is no real title available?)
- Closure via functional dependence simplification
- A UML profile for developing databases that conform to the third manifesto
- Computing Dependencies Using FCA
- The joy of implications, aka pure Horn formulas: mainly a survey
- Succinctness and tractability of closure operator representations
- On dependence logic
- Guaranteeing no interaction between functional dependencies and tree-like inclusion dependencies
- Normal forms and syntactic completeness proofs for functional independencies
- Computations with finite closure systems and implications
- Controlling entity integrity with key sets
- Graph-theoretical methods to construct entity-relationship databases
- Three views on dependency covers from an FCA perspective
- Hierarchical decompositions of implicational bases for the enumeration of meet-irreducible elements
- Towards declarative comparabilities: application to functional dependencies
- Approximate inference of functional dependencies from relations
- A minimal base or a direct base? That is the question!
- Computing the D-base and D-relation in finite closure systems
- Inclusion dependencies and their interaction with functional dependencies in SQL
- Enumerating the irreducible closed sets of an acyclic implicational base of bounded degree
- The synthesis approach for relational database design: An expanded perspective
- Some decision and counting problems of the Duquenne-Guigues basis of implications
- The multiple facets of the canonical direct unit implicational basis
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4023862)
