On the integrity of databases with incomplete information

We consider the meaningfulness of databases with incomplete information. The basic idea is that such a database is meaningful if it can be completed to a database with complete information that satisfies the integrity constraints. We look at two approaches to defining the notion of completion. The open-world assumption requires that the database with complete information be an extension of the database with incomplete information. The closed-world assumption requires that the database with complete information be a conservative extension of the database with incomplete information. We prove the somewhat surprising result that integrity under the closed-world assumption is * Address: lJ3M Research K55/801, 650 Harry Rd., San Jose, CA 9512043099. Permission to copy without fee all or part of this maicrial is granted provided tba~ the copies are not made or distributed for direct commercial advantage. the ACM copyright notice and the title of the publication and its dale appear, and notice is given that copying is by permission of the Association for Computing Machinery. l’o copy otherwise, or to republish. requires a fee and;or specific permission.

[1]  Richard Hull.  Non-Finite Specifiability of Projections of Functional Dependency Families , 1985, Theor. Comput. Sci..

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

[3]  Catriel Beeri,et al.  The Implication Problem for Data Dependencies , 1981, ICALP.

[4]  E. F. Codd,et al.  Understanding Relations (Installment #7) , 1974, FDT Bull. ACM SIGFIDET SIGMOD.

[5]  Moshe Y. Vardi,et al.  Notions of dependency satisfaction , 1986 .

[6]  Alberto O. Mendelzon,et al.  Notions of dependency satisfaction , 1982, PODS '82.

[7]  Jean-Marie Nicolas,et al.  Data Base: Theory vs. Interpretation , 1977, Logic and Data Bases.

[8]  Peter Honeyman,et al.  Testing satisfaction of functional dependencies , 1982, JACM.

[9]  J. D. Uiiman,et al.  Principles of Database Systems , 2004, PODS 2004.

[10]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[11]  Alfred V. Aho,et al.  Universality of data retrieval languages , 1979, POPL.

[12]  Ronald Fagin,et al.  On the semantics of updates in databases , 1983, PODS.

[13]  S. Feferman.  Two notes on abstract model theory. I. Properties invariant on the range of definable relations between structures , 1974 .

[14]  Ashok K. Chandra,et al.  Optimal implementation of conjunctive queries in relational data bases , 1977, STOC '77.

[15]  Raymond Reiter.  On Closed World Data Bases , 1977, Logic and Data Bases.

[16]  Marc H. Graham,et al.  On the complexity and axiomatizability of consistent database states , 1984, PODS '84.

[17]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

[18]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[19]  Petr Hájek,et al.  Some remarks on observational model-theoretic languages , 1976 .

[20]  Seymour Ginsburg,et al.  Characterizations for Functional Dependency and Boyce-CODD Normal Form Families , 1983, Theor. Comput. Sci..

[21]  Seymour Ginsburg,et al.  Properties of functional-dependency families , 1982, JACM.

[22]  Ashok K. Chandra.  Programming primitives for database languages , 1981, POPL '81.

[23]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[24]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[25]  Witold Lipski,et al.  On Databases with Incomplete Information , 1981, JACM.

[26]  Robert A. Kowalski,et al.  Logic as a Database Language , 1984, BNCOD.

[27]  Nicolas Spyratos,et al.  Partition semantics for relations , 1985, PODS '85.

[28]  David Maier,et al.  On the foundations of the universal relation model , 1984, TODS.

[29]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[30]  Raymond Reiter,et al.  Towards a Logical Reconstruction of Relational Database Theory , 1982, On Conceptual Modelling.

[31]  Raymond Reiter,et al.  A sound and sometimes complete query evaluation algorithm for relational databases with null values , 1986, JACM.

[32]  Richard Hull.  Finitely Specifiable Implicational Dependency Families , 1984, JACM.

[33]  Moshe Y. Vardi.  Querying logical databases , 1985, J. Comput. Syst. Sci..