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

Authors:
Catriel Beeri
Affiliations:
Princeton, Princeton, NJ
Venue:
ACM Transactions on Database Systems (TODS)
Year:
1980

Citing 6
Cited 58

Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies

ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
On Axiomatizing Multivalued Dependencies in Relational Databases

Journal of the ACM (JACM)
A complete axiomatization for functional and multivalued dependencies in database relations

SIGMOD '77 Proceedings of the 1977 ACM SIGMOD international conference on Management of data
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms

A Proof Procedure for Data Dependencies

Journal of the ACM (JACM)
Elimination of intersection anomalies from database schemes

Journal of the ACM (JACM)
Normalization of relations and PROLOG

Communications of the ACM
A theory of intersection anomalies in relational database schemes

Journal of the ACM (JACM)
G-base fourth normal form in relational database

CSC '89 Proceedings of the 17th conference on ACM Annual Computer Science Conference
An integrated approach to logical design of relational database schemes

ACM Transactions on Database Systems (TODS)
Perspectives on database theory

ACM SIGACT News
A formal approach to the definition and the design of conceptual schemata for databased systems

ACM Transactions on Database Systems (TODS)
A simplied universal relation assumption and its properties

ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries

ACM Transactions on Database Systems (TODS)
An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional Logic

Journal of the ACM (JACM)
An Equivalence Between Relational Database Dependencies and a Fragment of Propositional Logic

Journal of the ACM (JACM)
On the Complexity of Testing Implications of Functional and Join Dependencies

Journal of the ACM (JACM)
An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational Database

Journal of the ACM (JACM)
Subset Dependencies and a Completeness Result for a Subclass of Embedded Multivalued Dependencies

Journal of the ACM (JACM)
An automata-theoretic approach to branching-time model checking

Journal of the ACM (JACM)
An automata-theoretic approach to modular model checking

ACM Transactions on Programming Languages and Systems (TOPLAS)
Real-world MVD's

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Alternating-time temporal logic

Journal of the ACM (JACM)
Weak multivalued dependencies

PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
Elimination of intersection amomalies from database schemes

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Controlling FD and MVD Inferences in Multilevel Relational Database Systems

IEEE Transactions on Knowledge and Data Engineering
Constructing the Dependency Structure of a Multiagent Probabilistic Network

IEEE Transactions on Knowledge and Data Engineering
Comprehensive Approach to the Design of Relational Database Schemes

VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
Database Decomposition into Fourth Normal Form

VLDB '83 Proceedings of the 9th International Conference on Very Large Data Bases
Automating Modular Verification

CONCUR '99 Proceedings of the 10th International Conference on Concurrency Theory
Supporting Semantic Diversity in the Relational Data Model: The Case of Multi-Face Attributes

Information Systems Frontiers
Multi-valued dependencies in the presence of lists

PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Functional and multivalued dependencies in nested databases generated by record and list constructor

Annals of Mathematics and Artificial Intelligence
Axiomatisations of functional dependencies in the presence of records, lists, sets and multisets

Theoretical Computer Science - Logic, language, information and computation
On a problem of Fagin concerning multivalued dependencies in relational databases

Theoretical Computer Science
Database dependency discovery: a machine learning approach

AI Communications
Deciding implication for functional dependencies in complex-value databases

Theoretical Computer Science - Logic, language, information and computation
On inferences of full hierarchical dependencies

ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Full hierarchical dependencies in fixed and undetermined universes

Annals of Mathematics and Artificial Intelligence
Algorithms for acyclic database schemes

VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Discovery of multivalued dependencies from relations

Intelligent Data Analysis
Concurrent reachability games

Theoretical Computer Science
Database-oriented decision support systems

AFIPS '83 Proceedings of the May 16-19, 1983, national computer conference
Spoilt for Choice: Full First-Order Hierarchical Decompositions

WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
The Implication Problem of Functional Dependencies in Complex-value Databases

Electronic Notes in Theoretical Computer Science (ENTCS)
An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Appropriate reasoning about data dependencies in fixed and undetermined universes

FoIKS'08 Proceedings of the 5th international conference on Foundations of information and knowledge systems
A formal context for symmetric dependencies

ICFCA'08 Proceedings of the 6th international conference on Formal concept analysis
When data dependencies over SQL tables meet the logics of paradox and S-3

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
An O(n2) time algorithm for alternating Büchi games

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
A survey of stochastic ω-regular games

Journal of Computer and System Sciences
On multivalued dependencies in fixed and undetermined universes

FoIKS'06 Proceedings of the 4th international conference on Foundations of Information and Knowledge Systems
Characterisations of multivalued dependency implication over undetermined universes

Journal of Computer and System Sciences
Characterization and armstrong relations for degenerate multivalued dependencies using formal concept analysis

ICFCA'05 Proceedings of the Third international conference on Formal Concept Analysis
The implication problem of data dependencies over SQL table definitions: Axiomatic, algorithmic and logical characterizations

ACM Transactions on Database Systems (TODS)
Appropriate inferences of data dependencies in relational databases

Annals of Mathematics and Artificial Intelligence
On Inferences of Full First-Order Hierarchical Decompositions

Fundamenta Informaticae - Logic, Language, Information and Computation
Specification and verification of multi-agent systems

ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Efficient controller synthesis for consumption games with multiple resource types

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Reasoning about functional and full hierarchical dependencies over partial relations

Information Sciences: an International Journal
Hyperplane separation technique for multidimensional mean-payoff games

CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory

Quantified Score

Hi-index	0.02

Visualization

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.