Finitely Specifiable Implicational Dependency Families

DOI10.1145/62.2162zbMath0631.68077OpenAlexW2006330962MaRDI QIDQ3768430

Richard Hull

Publication date: 1984

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/62.2162

zbMATH Keywords

relational databaseimplicational dependencydatabase dependenciesrelational operatorsintegrity checkingfinite specifiabilityuser views

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (8)

Non-finite specifiability of projections of functional dependency families ⋮ Database survivability under dynamic constraints ⋮ Some characterizations of finitely specifiable implicational dependency families ⋮ The complexity of embedded axiomatization for a class of closed database views ⋮ Non first normal form relations: An algebra allowing data restructuring ⋮ Characterization of Optimal Complements of Database Views Defined by Projection ⋮ On the expressive power of data dependencies ⋮ Unique complements and decompositions of database schemata

This page was built for publication: Finitely Specifiable Implicational Dependency Families