On the computational complexity of cardinality constraints in relational databases (Q1154820)

From MaRDI portal
Revision as of 01:43, 14 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references