On the expressive power of data dependencies

DOI10.1007/BF00289111zbMath0617.68085OpenAlexW2062099202WikidataQ114694751 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

axiomatizabilitydata dependenciesalgebraic closure conditionsconsistent databasesexternal viewspreservation properties of dependenciessemantic specification of databases

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20) Other classical first-order model theory (03C68)

Related Items (6)

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

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

This page was built for publication: On the expressive power of data dependencies