On the Complexity of Testing Implications of Functional and Join Dependencies
- 1 October 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (4), 680-695
- https://doi.org/10.1145/322276.322280
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An Almost Linear-Time Algorithm for Computing a Dependency Basis in a Relational DatabaseJournal of the ACM, 1982
- An Equivalence Between Relational Database Dependencies and a Fragment of Propositional LogicJournal of the ACM, 1981
- On the menbership problem for functional and multivalued dependencies in relational databasesACM Transactions on Database Systems, 1980
- An Algorithm for Inferring Multivalued Dependencies with an Application to Propositional LogicJournal of the ACM, 1980
- Testing the universal instance assumptionInformation Processing Letters, 1980
- Testing implications of data dependenciesACM Transactions on Database Systems, 1979
- The theory of joins in relational databasesACM Transactions on Database Systems, 1979
- Computational problems related to the design of normal form relational schemasACM Transactions on Database Systems, 1979
- Theory of relations for databases — a tutorial surveyLecture Notes in Computer Science, 1978
- Multivalued dependencies and a new normal form for relational databasesACM Transactions on Database Systems, 1977