Some characterizations of finitely specifiable implicational dependency families

DOI10.1016/0020-0190(86)90116-XzbMATH Open0624.68092OpenAlexW2043408048MaRDI QIDQ578937FDOQ578937

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

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

zbMATH Keywords

relational databaseimplicational dependencyrelation schemerelational dependency

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Cites Work

• Horn clauses and database dependencies
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finitely Specifiable Implicational Dependency Families
• Title not available (Why is that?)

Cited In (2)

• Non-finite specifiability of projections of functional dependency families
• Title not available (Why is that?)

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)