On the computational complexity of cardinality constraints in relational databases

DOI10.1016/0020-0190(80)90013-7zbMATH Open0465.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

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

Cites Work

• Variations on the Common Subexpression Problem
• Title not available (Why is that?)

Cited In (3)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1154820)