scientific article

zbMath0743.68014MaRDI QIDQ3994395

Bernhard Thalheim

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dependenciesrelational database scheme

Mathematics Subject Classification ID

Database theory (68P15) Research exposition (monographs, survey articles) pertaining to computer science (68-02)

Related Items (28)

On the finite and general implication problems of independence atoms and keys ⋮ On a problem of Fagin concerning multivalued dependencies in relational databases ⋮ Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets ⋮ Semantics and Pragmatics of Integrity Constraints ⋮ A survey of some combinatorial results concerning functional dependencies in database relations. ⋮ Foundations of entity-relationship modeling ⋮ Full hierarchical dependencies in fixed and undetermined universes ⋮ Deciding implication for functional dependencies in complex-value databases ⋮ Asymptotic properties of keys and functional dependencies in random databases ⋮ Some Remarks on Relational Database Schemes Having Few Minimal Keys ⋮ Foundations for a Fourth Normal Form over SQL-Like Databases ⋮ A finite axiomatization of G-dependence ⋮ Controlling entity integrity with key sets ⋮ Appropriate inferences of data dependencies in relational databases ⋮ Characterisations of multivalued dependency implication over undetermined universes ⋮ Reasoning about functional and full hierarchical dependencies over partial relations ⋮ Constructing Armstrong tables for general cardinality constraints and not-null constraints ⋮ Semantics in Data and Knowledge Bases ⋮ 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 ⋮ Active integrity constraints for general-purpose knowledge bases ⋮ Appropriate Reasoning about Data Dependencies in Fixed and Undetermined Universes ⋮ Charting the completeness frontier of inference systems for multivalued dependencies ⋮ Approximation Logics for Subclasses of Probabilistic Conditional Independence and Hierarchical Dependence on Incomplete Data ⋮ Frontiers for propositional reasoning about fragments of probabilistic conditional independence and hierarchical database decompositions ⋮ Constraint-generating dependencies ⋮ Spoilt for Choice: Full First-Order Hierarchical Decompositions ⋮ Possibilistic keys

This page was built for publication: