On the computational complexity of cardinality constraints in relational databases (Q1154820): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Variations on the Common Subexpression Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Latest revision as of 11:50, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computational complexity of cardinality constraints in relational databases |
scientific article |
Statements
On the computational complexity of cardinality constraints in relational databases (English)
0 references
1980
0 references
NP-completeness
0 references
relational databases
0 references
join dependency
0 references
functional dependencies
0 references
domain dependency
0 references
