On the computational complexity of cardinality constraints in relational databases
- 1 October 1980
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 11 (2) , 98-101
- https://doi.org/10.1016/0020-0190(80)90013-7
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Variations on the Common Subexpression ProblemJournal of the ACM, 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