Constructing Armstrong tables for general cardinality constraints and not-null constraints

Hartmann, Sven, Kohler, Henning, Leck, Uwe, Link, Sebastian, Thalheim, Bernhard and Wang, Jing (2015) Constructing Armstrong tables for general cardinality constraints and not-null constraints Annals of Mathematics and Artificial Intelligence, 73 (1-2). pp. 139-165.

Full text not available from this repository.

Abstract

Integrity constraints capture relevant requirements of an application that should be satisfied by every state of the database. The theory of integrity constraints is largely a theory over relations. To make data processing more efficient, SQL permits database states to be partial bags that can accommodate incomplete and duplicate information. Integrity constraints, however, interact differently on partial bags than on the idealized special case of relations. In this current paper, we study the implication problem of the combined class of general cardinality constraints and not-null constraints on partial bags. We investigate structural properties of Armstrong tables for general cardinality constraints and not-null constraints, and prove exact conditions for their existence. For the fragment of general max-cardinality constraints, unary min-cardinality constraints and not-null constraints we show that the effort for constructing Armstrong tables is precisely exponential. For the same fragment we provide an axiomatic characterization of the implication problem. The major tool for establishing our results is the Hajnal and Szemer,di theorem on the equitable colorings of graphs.

Document Type: Article
Additional Information: Times Cited: 2
Research affiliation: OceanRep > The Future Ocean - Cluster of Excellence
Kiel University
Refereed: Yes
ISSN: 1012-2443
Projects: Future Ocean
Date Deposited: 18 Oct 2016 03:47
Last Modified: 28 Mar 2018 11:08
URI: http://eprints.uni-kiel.de/id/eprint/32508

Actions (login required)

View Item View Item