On the computational complexity of cardinality constraints in relational databases

DOI10.1016/0020-0190(80)90013-7zbMath0465.68058OpenAlexW2002345150MaRDI QIDQ1154820

Paris C. Kanellakis

Publication date: 1980

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(80)90013-7

zbMATH Keywords

NP-completenessrelational databasesfunctional dependenciesjoin dependencydomain dependency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Information storage and retrieval of data (68P20) Theory of operating systems (68N25)

Related Items (3)

Inferences for numerical dependencies ⋮ Incorporating cardinality constraints and synonym rules into conditional functional dependencies ⋮ I/O-efficient join dependency testing, Loomis-Whitney join, and triangle enumeration

Cites Work

• Unnamed Item
• Variations on the Common Subexpression Problem

This page was built for publication: On the computational complexity of cardinality constraints in relational databases