On the expressive power of data dependencies

DOI10.1007/BF00289111zbMath0617.68085WikidataQ114694751 ScholiaQ114694751MaRDI QIDQ1822528

Moshe Y. Vardi, Johann A. Makowsky

Publication date: 1986

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00289111

zbMATH Keywords

axiomatizability; data dependencies; algebraic closure conditions; consistent databases; external views; preservation properties of dependencies; semantic specification of databases

Mathematics Subject Classification ID

68P05: Data structures

68P20: Information storage and retrieval of data

03C68: Other classical first-order model theory

Related Items

Schema Mappings: A Case of Logical Dynamics in Database Theory, Why Horn formulas matter in computer science: initial structures and generic examples, Unique complements and decompositions of database schemata, Reasoning about functional and full hierarchical dependencies over partial relations, On a general class of data dependencies in the relational model and its implication problems, Logics of Finite Hankel Rank

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations for functional dependency and Boyce-Codd normal form families
• Vopěnka's principle and compact logics
• Finitely Specifiable Implicational Dependency Families
• A Proof Procedure for Data Dependencies
• On interpretations of relational languages and solutions to the implied constraint problem
• Testing satisfaction of functional dependencies
• Properties of functional-dependency families
• Horn clauses and database dependencies
• The Semantics of Predicate Logic as a Programming Language
• Equivalences among Relational Expressions
• A relational model of data for large shared data banks
• The decision problem for some classes of sentences without quantifiers