๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the computational complexity of cardinality constraints in relational databases

โœ Scribed by Paris C. Kanellakis

Book ID
113162177
Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
469 KB
Volume
11
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On the computational complexity of query
On the computational complexity of querying bounds on differences constraints
โœ Vittorio Brusoni; Luca Console; Paolo Terenziani ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 891 KB

Given a consistent knowledge base formed by a set of constraints, efficient query answering (e.g., checking whether a set of constraints is consistent with the knowledge base or necessarily true in it) is practically very important. In the paper we consider bounds on differences (which are an import