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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3729485
Language Label Description Also known as
default for all languages
No label defined
    English
    On the computational complexity of cardinality constraints in relational databases
    scientific article; zbMATH DE number 3729485

      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
      0 references