Access the full text.
Sign up today, get DeepDyve free for 14 days.
J Demetrovics, GOH Katona, A Sali (1992)
The characterization of branching dependenciesDiscret. Appl. Math., 40
W-D Langeveldt, S Link (2010)
Empirical evidence for the usefulness of Armstrong relations in the acquisition of meaningful functional dependenciesInf. Syst., 35
M Levene, G Loizou (1998)
Axiomatisation of functional dependencies in incomplete relationsTheor. Comput. Sci., 206
V Felea (1992)
Armstrong-like relations for functional partition dependenciesSci. Ann. Cuza Univ., 1
J Demetrovics, VD Thi (1995)
Some remarks on generating Armstrong and inferring functional dependencies relationActa Cybernet., 12
SW Liddle, DW Embley, SN Woodfield (1993)
Cardinality constraints in semantic data modelsData Knowl. Eng., 11
HA Kierstead, AV Kostochka, M Mydlarz, E Szemerdi (2010)
A fast algorithm for equitable coloringCombinatorica, 30
HA Kierstead, AV Kostochka (2008)
A short proof of the Hajnal-Szemerédi Theorem on equitable colouringComb. Probab. Comput., 17
P Atzeni, N Morfuni (1986)
Functional dependencies and constraints on null values in database relationsInform. Control., 70
S Hartmann (2001)
On the implication problem for cardinality constraints and functional dependenciesAnn. Math. Artif. Intell., 33
EF Codd (1986)
Missing information (applicable and inapplicable) in relational databasesSIGMOD Record, 15
EF Codd (1970)
A relational model of data for large shared data banksComm. ACM, 13
C Zaniolo (1984)
Database relations with null valuesJ. Comput. Syst. Sci., 28
S Hartmann, M Kirchberg, S Link (2012)
Design by example for SQL table definitions with functional dependenciesVLDB J., 21
J Demetrovics, L Libkin, IB Muchnik (1992)
Functional dependencies in relational databases: a lattice point of viewDiscret. Appl. Math., 40
M Lenzerini, P Nobili (1990)
On the satisfiability of dependency constraints in entity-relationship schemataInform. Syst., 15
EF Codd (1979)
Extending the database relational model to capture more meaningACM ToDS, 4
GOH Katona, A Sali (2004)
New type of coding problem motivated by database theoryDiscret. Appl. Math., 144
S Hartmann, S Link (2010)
Numerical constraints on XML dataInf. Comput., 208
H Mannila, K-J Räihä (1986)
Design by example: an application of Armstrong relationsJ. Comput. Syst. Sci., 33
R Fagin, MY Vardi (1983)
Armstrong databases for functional and inclusion dependenciesInf. Process. Lett., 16
J Demetrovics, G Gyepesi (1981)
On the functional dependency and some generalizations of itActa Cybernet., 5
R Fagin (1982)
Horn clauses dependencies and databaseJ. ACM, 29
PP Chen (1976)
The entity-relationship model: towards a unified view of dataACM ToDS, 1
F De Marchi, J-M Petit (2007)
Semantic sampling of existing databases through informative Armstrong databasesInf. Syst., 32
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.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Jun 25, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.