1980ACM Transactions on Database SystemsOpen access

On the menbership problem for functional and multivalued dependencies in relational databases

Catriel Beeri

Open full text 174 citations

Abstract

The problem of whether a given dependency in a database relation can be derived from a given set of dependencies is investigated. We show that the problem can be decided in polynomial time when the given set consists of either multivalued dependencies only or of both functional and multivalued dependencies and the given dependency is also either a functional or a multivalued dependency. These results hold when the derivations are restricted not to use the complementation rule.

Open-access reader

About this research paper

What this paper is about

The problem of whether a given dependency in a database relation can be derived from a given set of dependencies is investigated. We show that the problem can be decided in polynomial time when the given set consists of either multivalued dependencies only or of both functional and multivalued dependencies and the given dependency is also either a functional or a multivalued dependency. These results hold when the derivations are restricted not to use the complementation rule.

Why it matters

OpenAlex reports 174 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The problem of whether a given dependency in a database relation can be derived from a given set of dependencies is investigated. We show that the problem can be decided in polynomial time when the given set consists of either multivalued dependencies only or of both functional and multivalued dependencies and the given dependency is also either a functional or a multivalued dependency. These results hold when the derivations are restricted not to use the complementation rule.

Key concepts: Functional dependency, Dependency theory (database theory), Computer science, Dependency (UML), Set (abstract data type), Relational database, Relation (database), Theoretical computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
On the menbership problem for functional and multivalued dependencies in relational databases — Research Paper | ScholarLens