Degrees of Exclusivity in Disjunctive Databases

Ever since the emergence of the relational database model, the problem of incompleteness has been studied extensively. Declarative semantics for disjunctive databases widely adopt two methodologies representing opposite ends of the spectrum - Minker's GCWA interprets disjunctions exclusively while Ross and Topor's DDR interprets them inclusively. We argue that the use of either one as the semantics is limiting. For example, in a blood group relation, saying that the blood group of John is A or B, BG(John,A) ∨ BG(John,B) can be interpreted exclusively while the statement supplier S1 supplies part P1 or P2 to project J1, supplies(S1, P1, J1) ∨ supplies(S1, P2, J1) need not necessarily be exclusive. In this paper, we present a model that allows the nature of the disjunctions to be represented explicitly and show its relation to other semantics for disjunctive databases. A notable feature of this extension is that it does not require variables in order to represent indefinite information.

[1]  Rajshekhar Sunderraman,et al.  Indefinite and maybe information in relational databases , 1990, TODS.

[2]  Ken-Chih Liu,et al.  Towards a relational model for exclusively disjunctive information , 1993, CSC '93.

[3]  Eliezer L. Lozinskii Plausible World Assumption , 1989, KR.

[4]  Edward P. F. Chan A Possible World Semantics for Disjunctive Databases , 1993, IEEE Trans. Knowl. Data Eng..

[5]  Arbee L. P. Chen,et al.  An Exploration of Relationships Among Exclusive Disjunctive Data , 1995, IEEE Trans. Knowl. Data Eng..

[6]  Chiaki Sakama,et al.  Possible Model Semantics for Disjunctive Databases II (Extended Abstract) , 1990, International Conference on Logic Programming and Non-Monotonic Reasoning.

[7]  Chiaki Sakama,et al.  Possible Model Semantics for Disjunctive Databases , 1989, DOOD.

[8]  Jennifer Widom,et al.  Working Models for Uncertain Data , 2006, 22nd International Conference on Data Engineering (ICDE'06).

[9]  Rajshekhar Sunderraman,et al.  On representing indefinite and maybe information in relational databases , 1988, Proceedings. Fourth International Conference on Data Engineering.

[10]  Rajshekhar Sunderraman,et al.  On representing indefinite and maybe information in relational databases: a generalization , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

[11]  Tomasz Imielinski,et al.  Incomplete Information in Relational Databases , 1984, JACM.

[12]  Shamim A. Naqvi,et al.  Using Constraints for Efficient Query Processing in Nondeterministic Databases , 1995, IEEE Trans. Knowl. Data Eng..

[13]  Kenneth A. Ross,et al.  Inferring negative information from disjunctive databases , 2004, Journal of Automated Reasoning.

[14]  Françoise Gire,et al.  A New Partial Semantics for Disjunctive Deductive Databases , 2005, Fundam. Informaticae.

[15]  R. Sunderraman,et al.  A Generalized Relational Model for Indefinite and Maybe Information , 1991, IEEE Trans. Knowl. Data Eng..

[16]  Adegbemiga Ola,et al.  Relational databases with exclusive disjunctions , 1992, [1992] Eighth International Conference on Data Engineering.