Inferring multivalued dependencies from functional and join dependencies
type: Item
instance of: scholarly article
title: Inferring multivalued dependencies from functional and join dependencies
zbMATH Open document ID: 0492.68070
DOI: 10.1007/BF00290729
published in: Acta Informatica
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3774917
zbMATH Keywords: algorithm
zbMATH Keywords: worst case running time
zbMATH Keywords: implication
zbMATH Keywords: embedded multivalued dependencies
zbMATH Keywords: lossless join dependencies
zbMATH Keywords: acyclic join dependencies
zbMATH Keywords: first order hierarchical decompositions
zbMATH Keywords: functional dependencies
author: Moshe Y. Vardi
Wikidata QID: Q114694748
MaRDI profile type: Publication
cites work: Decompositions and functional dependencies in relations
cites work: On the menbership problem for functional and multivalued dependencies in relational databases
cites work: On the Desirability of Acyclic Database Schemes
cites work: Inferences of multivalued dependencies in fixed and undetermined universes
cites work: Equivalence of Relational Database Schemes
cites work: Q3912018
cites work: A Proof Procedure for Data Dependencies
cites work: Horn clauses and database dependencies
cites work: A simplied universal relation assumption and its properties
cites work: An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database
cites work: Decision Problems for Multivalued Dependencies in Relational Databases
cites work: On Axiomatizing Multivalued Dependencies in Relational Databases
cites work: The interaction of integrity constraints in an information system
cites work: Q4162638
cites work: An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic
cites work: A Complete Axiomatization of Full Join Dependencies
cites work: Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: On the Complexity of Testing Implications of Functional and Join Dependencies
description: scientific article; zbMATH DE number 3774917