Access patterns and integrity constraints revisited

We consider which queries are answerable in the presence of access restrictions and integrity constraints, and which portions of the schema are accessible in the presence of access restrictions and constraints. Unlike prior work, we focus on integrity constraint languages that subsume inclusion dependencies. We also use a semantic definition of answerability: a query is answerable if the accessible information is sufficient to determine its truth value. We show that answerability is decidable for the class of guarded dependencies, which includes all inclusion dependencies, and also for constraints given in the guarded fragment of first-order logic. We also show that answerable queries have "query plans" in a restricted language. We give corresponding results for extractability of portions of the schema. Our results relate querying with limited access patterns, determinacy-vs-rewriting, and analysis of guarded constraints.

[1]  Bertram Ludäscher,et al.  Processing first-order queries under limited access patterns , 2004, PODS '04.

[2]  Bertram Ludäscher,et al.  Processing Unions of Conjunctive Queries with Negation under Limited Access Patterns , 2004, EDBT.

[3]  Chen Li,et al.  Computing complete answers to queries in the presence of limited access patterns , 2003, The VLDB Journal.

[4]  Anand Rajaraman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS.

[5]  Ronald Fagin,et al.  Data exchange: semantics and query answering , 2003, Theor. Comput. Sci..

[6]  Jeffrey D. Ullman,et al.  Answering queries using templates with binding patterns (extended abstract) , 1995, PODS '95.

[7]  Victor Vianu,et al.  Views and queries: Determinacy and rewriting , 2010, TODS.

[8]  Andrea Calì,et al.  A general datalog-based framework for tractable query answering over ontologies , 2009, SEBD.

[9]  Alon Y. Halevy,et al.  Recursive Plans for Information Gathering , 1997, IJCAI.

[10]  Jeffrey D. Ullman,et al.  Principles Of Database And Knowledge-Base Systems , 1979 .

[11]  Balder ten Cate,et al.  Guarded Negation , 2011, ICALP.

[12]  David S. Johnson,et al.  Testing containment of conjunctive queries under functional and inclusion dependencies , 1982, J. Comput. Syst. Sci..

[13]  Ioana Manolescu,et al.  Query optimization in the presence of limited access patterns , 1999, SIGMOD '99.

[14]  Michael Benedikt,et al.  Rewriting Guarded Negation Queries , 2013, MFCS.

[15]  Riccardo Rosati.  On the decidability and finite controllability of query processing in databases with incomplete information , 2006, PODS '06.

[16]  Alin Deutsch,et al.  Rewriting queries using views with access patterns under integrity constraints , 2005, Theor. Comput. Sci..

[17]  Maarten Marx,et al.  Queries determined by views: pack your views , 2007, PODS.

[18]  Balder ten Cate,et al.  Queries with Guarded Negation , 2012, Proc. VLDB Endow..

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

[20]  Andrea Calì,et al.  Taming the Infinite Chase: Query Answering under Expressive Relational Constraints , 2008, Description Logics.

[21]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[22]  Foto N. Afrati,et al.  Determinacy and query rewriting for conjunctive queries and views , 2011, Theor. Comput. Sci..

[23]  Edward Y. Chang,et al.  Answering queries with useful bindings , 2001, TODS.

[24]  Daniel Pasaila,et al.  Conjunctive queries determinacy and rewriting , 2011, ICDT '11.

[25]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .