Sergio Greco
ABSTRACT
Incomplete information arises in many database applications, such as data integration, data exchange, inconsistency management, data cleaning, ontological reasoning, and many others. A principled way of answering queries over incomplete databases is to compute certain answers, which are query answers that can be obtained from every complete database represented by an incomplete one.
For databases containing (labeled) nulls, certain answers to positive queries can be easily computed in polynomial time, but for more general queries with negation the problem becomes coNP-hard. To make query answering feasible in practice, one might resort to SQL's evaluation, but unfortunately, the way SQL behaves in the presence of nulls may result in wrong answers.
Thus, on the one hand, SQL's evaluation is efficient but flawed, on the other hand, certain answers are a principled semantics but with high complexity.
To deal with issue, recent research has focused on developing polynomial time approximation algorithms for computing (approximate) certain answers. This paper surveys recent advances in this area.
- Serge Abiteboul and Gösta Grahne. 1985. Update Semantics for Incomplete Databases. In Proc. Very Large Data Bases (VLDB) Conference. 1--12. Google Scholar
Digital Library
- Marcelo Arenas, Leopoldo E. Bertossi, and Jan Chomicki. 1999. Consistent Query Answers in Inconsistent Databases. In Proc. Symposium on Principles of Database Systems (PODS). 68--79. Google ScholarDigital Library
- Leopoldo E. Bertossi. 2009. Null Values. In Encyclopedia of Database Systems. 1924--1925.Google Scholar
- Leopoldo E. Bertossi. 2011. Database Repairing and Consistent Query Answering. Morgan & Claypool Publishers. Google ScholarDigital Library
- Meghyn Bienvenu and Magdalena Ortiz. 2015. Ontology-Mediated Query Answering with Data-Tractable Description Logics. In Reasoning Web. 218--307.Google Scholar
- Marco Calautti, Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2016. Exploiting Equality Generating Dependencies in Checking Chase Termination. PVLDB 9, 5 (2016), 396--407. Google ScholarDigital Library
- Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. 2012. A general Datalogbased framework for tractable query answering over ontologies. Journal of Web Semantics 14 (2012), 57--83. Google ScholarDigital Library
- Marco Console, Paolo Guagliardo, and Leonid Libkin. 2016. Approximations and Refinements of Certain Answers via Many-Valued Logics. In Proc. of International Conference on Principles of Knowledge Representation and Reasoning (KR). 349--358. Google ScholarDigital Library
- Marco Console, Paolo Guagliardo, and Leonid Libkin. 2017. On Querying Incomplete Information in Databases under Bag Semantics. In Proc. International Joint Conference on Artificial Intelligence (IJCAI). 993--999. Google ScholarDigital Library
- Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati. 2007. On reconciling data exchange, data integration, and peer data management. In Proc. Symposium on Principles of Database Systems (PODS). 133--142. Google ScholarDigital Library
- Ting Deng, Wenfei Fan, and Floris Geerts. 2016. Capturing Missing Tuples and Missing Values. ACM Trans. Database Syst. 41, 2 (2016), 10:1--10:47. Google ScholarDigital Library
- Fangqing Dong and Laks V. S. Lakshmanan. 1992. Deductive Databases with Incomplete Information. In Proc. Joint International Conference and Symposium on Logic Programming (JICSLP). 303--317.Google Scholar
- Nicola Fiorentino, Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2018. ACID: A System for Computing Approximate Certain Query Answers over Incomplete Databases. In Proc. International Conference on Management of Data (SIGMOD). to appear. Google ScholarDigital Library
- Filippo Furfaro, Sergio Greco, and Cristian Molinaro. 2007. A three-valued semantics for querying and repairing inconsistent databases. Annals of Mathematics and Artificial Intelligence 51, 2-4 (2007), 167--193. Google ScholarDigital Library
- Gösta Grahne. 1984. Dependency Satisfaction in Databases with Incomplete Information. In Proc. Very Large Data Bases (VLDB) Conference. 37--45. Google ScholarDigital Library
- John Grant. 1977. Null Values in a Relational Data Base. Information Processessing Letters 6, 5 (1977), 156--157.Google ScholarCross Ref
- Sergio Greco, Cristian Molinaro, and Francesca Spezzano. 2012. Incomplete Data and Data Dependencies in Relational Databases. Morgan & Claypool Publishers. Google ScholarDigital Library
- Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. 2017. Computing Approximate Certain Answers over Incomplete Databases. In Proc. Alberto Mendelzon International Workshop on Foundations of Data Management and the Web (AMW).Google Scholar
- Paolo Guagliardo and Leonid Libkin. 2016. Making SQL Queries Correct on Incomplete Databases: A Feasibility Study. In Proc. Symposium on Principles of Database Systems (PODS). 211--223. Google ScholarDigital Library
- Tomasz Imielinski. 1991. Incomplete Deductive Databases. Annals of Mathematics and Artificial Intelligence 3, 2-4 (1991), 259--293.Google ScholarCross Ref
- Tomasz Imielinski and Witold Lipski Jr. 1984. Incomplete Information in Relational Databases. Journal of the ACM 31, 4 (1984), 761--791. Google ScholarDigital Library
- Paraschos Koutris and Jef Wijsen. 2015. The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints. In Proc. Symposium on Principles of Database Systems (PODS). 17--29. Google ScholarDigital Library
- Maurizio Lenzerini. 2002. Data Integration: A Theoretical Perspective. In Proc. Symposium on Principles of Database Systems (PODS). 233--246. Google ScholarDigital Library
- Leonid Libkin. 2015. SQL's Three-Valued Logic and Certain Answers. In Proc. International Conference on Database Theory (ICDT). 94--109.Google Scholar
- Leonid Libkin. 2016. SQL's Three-Valued Logic and Certain Answers. ACM Transactions Database Systems 41, 1 (2016), 1. Google ScholarDigital Library
- Raymond Reiter. 1986. A sound and sometimes complete query evaluation algorithm for relational databases with null values. Journal of the ACM 33, 2 (1986), 349--370. Google ScholarDigital Library
- Moshe Y. Vardi. 1986. On the Integrity of Databases with Incomplete Information. In Proc. Symposium on Principles of Database Systems (PODS). 252--266. Google ScholarDigital Library
Index Terms
- Algorithms for Computing Approximate Certain Answers over Incomplete Databases
Recommendations
ACID: A System for Computing Approximate Certain Query Answers over Incomplete Databases
SIGMOD '18: Proceedings of the 2018 International Conference on Management of DataIncomplete information arises in many current database applications. 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 ...
Approximation algorithms for querying incomplete databases
AbstractCertain answers are a widely accepted semantics of query answering over incomplete databases. As their computation is a coNP-hard problem, recent research has focused on developing (polynomial time) evaluation algorithms with ...
Highlights- Algorithms to compute sound sets of certain query answers over incomplete databases.
Computing certain answers in the presence of dependencies
In this paper we consider conjunctive queries and views, and we investigate the problem of query answering using views in the presence of dependencies and in particular the problem of finding equivalent and maximally contained rewritings of a query ...
Comments