Some characterizations of finitely specifiable implicational dependency families

DOI10.1016/0020-0190(86)90116-XMaRDI QIDQ578937zbMATH OpenOpenAlexFDO

Authors Kazem Taghva

Publication date 1986

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(86)90116-x

zbMATH Keywords

relational databaseimplicational dependencyrelation schemerelational dependency

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Non-finite specifiability of projections of functional dependency families
• scientific article; zbMATH DE number 810104
• The implication and finite implication problems for typed template dependencies
• scientific article; zbMATH DE number 782028
• A finite axiomatization of conditional independence and inclusion dependencies

Cites work

• scientific article; zbMATH DE number 3890770 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 3076636 (Why is no real title available?)
• Finitely Specifiable Implicational Dependency Families
• Horn clauses and database dependencies

Cited in

(2)

• Non-finite specifiability of projections of functional dependency families
• scientific article; zbMATH DE number 810104 (Why is no real title available?)

This page was built for publication: Some characterizations of finitely specifiable implicational dependency families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q578937)