The implication and finite implication problems for typed template dependencies

DOI10.1016/0022-0000(84)90074-6zbMath0586.68084OpenAlexW2172111502WikidataQ114685268 ScholiaQ114685268MaRDI QIDQ1071525

Moshe Y. Vardi

Publication date: 1984

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(84)90074-6

zbMATH Keywords

relational databasedata dependenciesjoin dependencies

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Related Items (6)

Incomplete deductive databases ⋮ On rules with existential variables: walking the decidability line ⋮ Database Theory, Yuri, and Me ⋮ Verification of knowledge bases based on containment checking ⋮ Combining Horn rules and description logics in CARIN ⋮ The implication and finite implication problems for typed template dependencies

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The implication and finite implication problems for typed template dependencies
• Algebraic dependencies
• Formal Systems for Tuple and Equality Generating Dependencies
• The word problem for cancellation semigroups with zero
• Equivalence of Relational Database Schemes
• Template Dependencies
• A Complete Axiomatization of Full Join Dependencies
• Horn clauses and database dependencies
• Equivalences among Relational Expressions
• Tools for Template Dependencies
• A relational model of data for large shared data banks

This page was built for publication: The implication and finite implication problems for typed template dependencies