Computing Approximate Certain Answers over Incomplete Databases

Certain answers are a widely accepted semantics of query answering over incomplete databases. Since their computation is a coNP-hard problem, recent research has focused on developing evaluation algorithms with correctness guarantees, that is, techniques computing a sound but possibly incomplete set of certain answers. In this paper, we show how novel evaluation algorithms with correctness guarantees can be developed leveraging conditional tables and the conditional evaluation of queries, while retaining polynomial time data complexity.

[1]  Maurizio Lenzerini,et al.  On reconciling data exchange, data integration, and peer data management , 2007, PODS '07.

[2]  M. Arenas,et al.  SQL ' s Three-Valued Logic and Certain Answers , 2015 .

[3]  Gösta Grahne,et al.  Dependency Satisfaction in Databases with Incomplete Information , 1984, VLDB.

[4]  Sergio Greco,et al.  Incomplete Data and Data Dependencies in Relational Databases , 2012, Incomplete Data and Data Dependencies in Relational Databases.

[5]  Magdalena Ortiz,et al.  Ontology-Mediated Query Answering with Data-Tractable Description Logics , 2015, Reasoning Web.

[6]  Serge Abiteboul,et al.  Update Semantics for Incomplete Databases , 1985, VLDB.

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

[8]  Maurizio Lenzerini,et al.  Data integration: a theoretical perspective , 2002, PODS.

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

[10]  Marco Calautti,et al.  Exploiting Equality Generating Dependencies in Checking Chase Termination , 2016, Proc. VLDB Endow..

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

[12]  Georg Gottlob,et al.  Achieving new upper bounds for the hypergraph duality problem through logic , 2014, CSL-LICS.

[13]  Jan Chomicki,et al.  Consistent query answers in inconsistent databases , 1999, PODS '99.

[14]  Leonid Libkin,et al.  Incomplete data: what went wrong, and how to fix it , 2014, PODS.

[15]  Paolo Papotti,et al.  The LLUNATIC Data-Cleaning Framework , 2013, Proc. VLDB Endow..

[16]  Leonid Libkin.  Certain answers as objects and knowledge , 2016, Artif. Intell..

[17]  Leonid Libkin,et al.  Making SQL Queries Correct on Incomplete Databases: A Feasibility Study , 2016, PODS.

[18]  Marcelo Arenas,et al.  Foundations of Data Exchange , 2014 .

[19]  Jef Wijsen,et al.  The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints , 2015, ACM Trans. Database Syst..

[20]  Sergio Greco,et al.  Checking Chase Termination: Cyclicity Analysis and Rewriting Techniques , 2015, IEEE Transactions on Knowledge and Data Engineering.

[21]  Leopoldo E. Bertossi,et al.  Database Repairing and Consistent Query Answering , 2011, Database Repairing and Consistent Query Answering.

[22]  Witold Lipski.  On Relational Algebra with Marked Nulls. , 1984, PODS 1984.

[23]  Serge Abiteboul,et al.  On the Representation and Querying of Sets of Possible Worlds , 1991, Theor. Comput. Sci..

[24]  Gösta Grahne,et al.  The Problem of Incomplete Information in Relational Databases , 1991, Lecture Notes in Computer Science.

[25]  Leonid Libkin.  SQL's Three-Valued Logic and Certain Answers , 2015, ICDT.