On the Computational Complexity of Cardinality Constraints in Relational Databases
| dc.contributor.author | Kanellakis, Paris C. | en_US |
| dc.date.accessioned | 2023-03-29T14:16:36Z | |
| dc.date.available | 2023-03-29T14:16:36Z | |
| dc.date.issued | 1980-03 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/148987 | |
| dc.description.abstract | We show that the problem of determining whether of not a lossless join property holds for a database, in the presence of key dependencies and cardinality constraints on the domains of the attributes is NP-complete. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TM-160 | |
| dc.title | On the Computational Complexity of Cardinality Constraints in Relational Databases | en_US |
| dc.identifier.oclc | 6635694 |
