Abstract
In many database applications there is the need of extracting information from incomplete data. In such scenarios, certain answers are the most widely adopted semantics of query answering. Unfortunately, the computation of certain query answers is a coNP-hard problem. To make query answering feasible in practice, recent research has focused on developing polynomial time algorithms computing sound (but possibly incomplete) sets of certain answers. In this paper, we propose a novel technique that allows us to improve recently proposed approximation algorithms, obtaining a good balance between running time and quality of the results. We report experimental results confirming the effectiveness of the new technique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Transaction processing performance council. TPC benchmark H standard specification, November 2014. Revision 2.17.1. (TPC-H)
Arenas, M., Bertossi, L.E., Chomicki, J.: Consistent query answers in inconsistent databases. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 68–79 (1999)
Bertossi, L.E.: Database Repairing and Consistent Query Answering. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2011)
Bienvenu, M., Ortiz, M.: Ontology-mediated query answering with data-tractable description logics. In: Faber, W., Paschke, A. (eds.) Reasoning Web 2015. LNCS, vol. 9203, pp. 218–307. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21768-0_9
Calì, A., Gottlob, G., Lukasiewicz, T.: A general datalog-based framework for tractable query answering over ontologies. J. Web Semant. 14, 57–83 (2012)
Console, M., Guagliardo, P., Libkin, L.: Approximations and refinements of certain answers via many-valued logics. In: Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 349–358 (2016)
De Giacomo, G., Lembo, D., Lenzerini, M., Rosati, R.: On reconciling data exchange, data integration, and peer data management. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 133–142 (2007)
Fiorentino, N., Greco, S., Molinaro, C., Trubitsyna, I.: ACID: a system for computing approximate certain query answers over incomplete databases. In: Proceedings of the International Conference on Management of Data (SIGMOD), pp. 1685–1688 (2018)
Furfaro, F., Greco, S., Molinaro, C.: A three-valued semantics for querying and repairing inconsistent databases. Ann. Math. Artif. Intell. 51(2–4), 167–193 (2007)
Grahne, G. (ed.): The Problem of Incomplete Information in Relational Databases. LNCS, vol. 554. Springer, Heidelberg (1991). https://doi.org/10.1007/3-540-54919-6
Greco, S., Molinaro, C., Spezzano, F.: Incomplete Data and Data Dependencies in Relational Databases. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, San Rafael (2012)
Greco, S., Molinaro, C., Trubitsyna, I.: Computing approximate certain answers over incomplete databases. In: Proceedings of the Alberto Mendelzon International Workshop on Foundations of Data Management and the Web (AMW) (2017)
Greco, S., Molinaro, C., Trubitsyna, I.: Approximation algorithms for querying incomplete databases. Inf. Syst. 1–54 (2019, to appear)
Guagliardo, P., Libkin, L.: Making SQL queries correct on incomplete databases: a feasibility study. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 211–223 (2016)
Imielinski, T., Lipski Jr., W.: Incomplete information in relational databases. J. ACM 31(4), 761–791 (1984)
Koutris, P., Wijsen, J.: The data complexity of consistent query answering for self-join-free conjunctive queries under primary key constraints. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 17–29 (2015)
Lenzerini, M.: Data integration: a theoretical perspective. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 233–246 (2002)
Libkin, L.: How to define certain answers. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 4282–4288 (2015)
Libkin, L.: Certain answers as objects and knowledge. Artif. Intell. 232, 1–19 (2016)
Lipski, W.: On relational algebra with marked nulls. In: Proceedings of the Symposium on Principles of Database Systems (PODS), pp. 201–203 (1984)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Fiorentino, N., Molinaro, C., Trubitsyna, I. (2019). Optimizing the Computation of Approximate Certain Query Answers over Incomplete Databases. In: Cuzzocrea, A., Greco, S., Larsen, H., Saccà , D., Andreasen, T., Christiansen, H. (eds) Flexible Query Answering Systems. FQAS 2019. Lecture Notes in Computer Science(), vol 11529. Springer, Cham. https://doi.org/10.1007/978-3-030-27629-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-27629-4_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27628-7
Online ISBN: 978-3-030-27629-4
eBook Packages: Computer ScienceComputer Science (R0)