Describing and deriving certain answers over partial databases

Although there has been much work in recent years on answering queries using views, there has been less work on deriving answers from partial databases. That is given a partial database state DV, materialized via the view V, what queries can be asked over DV that can be answered with certainty using only the instance of the partial database and standard query evaluation mechanisms. We define these as the derivable answers and show several special cases in which we can compute and intensionally describe them.

[1]  Moshé M. Zloof Query-by-Example: A Data Base Language , 1977, IBM Syst. J..

[2]  Amihai Motro,et al.  Completeness Information and Its Application to Query Processing , 1986, VLDB.

[3]  Alon Y. Halevy,et al.  Theory of answering queries using views , 2000, SGMD.

[4]  Tomasz Imielinski,et al.  On Representing Incomplete Information in a Relational Data Base , 1981, VLDB.

[5]  Harald Ganzinger,et al.  A superposition decision procedure for the guarded fragment with equality , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

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

[7]  Connolly,et al.  Database Systems , 2004 .

[8]  Alon Y. Halevy,et al.  Answering queries using views: A survey , 2001, The VLDB Journal.

[9]  Michael Jason Minock,et al.  Modular Generation of Relational Query Paraphrases , 2006 .

[10]  Christoph Weidenbach,et al.  S PASS Version 2.0 , 2002, CADE.

[11]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[12]  Serge Abiteboul,et al.  Complexity of answering queries using materialized views , 1998, PODS.

[13]  Alon Y. Levy Obtaining Complete Answers from Incomplete Databases , 1996, VLDB 1996.

[14]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[15]  Amihai Motro Panorama: A database system that annotates its answers to queries with their properties , 2004, Journal of Intelligent Information Systems.

[16]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

[17]  E. F. Codd,et al.  Relational Completeness of Data Base Sublanguages , 1972, Research Report / RJ / IBM / San Jose, California.

[18]  Kees van Deemter,et al.  Formal Issues in Natural Language Generation , 2006 .

[19]  Per-Åke Larson,et al.  Computing Queries from Derived Relations , 1985, VLDB.

[20]  Michael Jason Minock,et al.  A STEP Towards Realizing Codd's Vision of Rendezvous with the Casual User , 2007, VLDB.

[21]  P. Bernays,et al.  Zum Entscheidungsproblem der mathematischen Logik , 1928 .

[22]  A. Wilkie THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997). , 1998 .

[23]  Amihai Motro,et al.  Integrity = validity + completeness , 1989, TODS.