On the Computational Complexity of Cardinality Constraints in Relational Databases

Kanellakis, Paris C.

On the Computational Complexity of Cardinality Constraints in Relational Databases

Download

Name

MIT-LCS-TM-160.pdf

Size

1.47 MB

Format

Adobe PDF

Checksum (MD5)

9a6139686cca63b20e3d4398e6fdb46f

Author(s)

Kanellakis, Paris C.

Date Issued

March 1980

Series/Report no.

MIT-LCS-TM-160

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.

Persistent DSpace Link

https://hdl.handle.net/1721.1/148987