Abstract
There is a growing number of applications where inconsistent information arises. In the last two decades, the emerging approach for dealing with such scenarios is to “tolerate” inconsistency and provide appropriate reasoning mechanisms. In particular, consistent query answering has been widely accepted as a principled approach for query answering. Several practical and theoretical issues regarding the consistent query answering framework have been widely investigated in literature and different techniques for evaluating consistent answers have been proposed. In this work, we provide a brief survey of the research on techniques for repairing and querying inconsistent databases developed by the database research group of the DIMES Department at the University of Calabria.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
M. Arenas, L.E. Bertossi, J. Chomicki, X. He, V. Raghavan, J. Spinrad, Scalar aggregation in inconsistent databases. Theor. Comput. Sci. (TCS) 3(296), 405–434 (2003)
M. Calautti, S. Greco, I. Trubitsyna, Detecting decidable classes of finitely ground logic programs with function symbols, in PPDP (2013), pp. 239–250
M. Calautti, S. Greco, C. Molinaro, I. Trubitsyna, Checking termination of logic programs with function symbols through linear constraints, in RuleML (2014), pp. 97–111
M. Calautti, G. Gottlob, A. Pieris, Chase termi- nation for guarded existential rules, in PODS (2015)
M. Calautti, S. Greco, C. Molinaro, I. Trubitsyna, Logic program termination analysis using atom sizes, in IJCAI (2015), pp. 2833–2839
M. Calautti, S. Greco, C. Molinaro, I. Trubitsyna, Exploiting equality generating dependencies in checking chase termination. PVLDB 9(5), 396–407 (2016)
M. Calautti, S. Greco, C. Molinaro, I. Trubitsyna, Using linear constraints for logic program termination analysis. TPLP 16(3), 353–377 (2016)
A. Calì, G. Gottlob, M. Kifer, Taming the infinite chase: query answering under expressive relational constraints. JAIR 48, 115–174 (2013)
L. Caroprese, M. Truszczynski, Active integrity constraints and revision programming. TPLP 11(6), 905–952 (2011)
L. Caroprese, S. Greco, I. Trubitsyna, E. Zumpano, Preferred generalized answers for inconsistent databases, in ISMIS (2006), pp. 344–349
L. Caroprese, S. Greco, C. Molinaro, Prioritized active integrity constraints for database maintenance, in Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA) (2007), pp. 459–471
L. Caroprese, S. Greco, E. Zumpano, Active integrity constraints for database consistency maintenance. IEEE Trans. Knowl. Data Eng. 21(7), 1042–1058 (2009)
A. Deutsch, A. Nash, J.B. Remmel, The chase revisited, in PODS (2008), pp. 149–158
R. Fagin, P.G. Kolaitis, R.J. Miller, L. Popa, Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)
R. Fagin, P.G. Kolaitis, L. Popa, Data exchange: getting to the core. ACM TODS 30(1), 174–210 (2005)
B. Fazzinga, S. Flesca, F. Furfaro, F. Parisi, Dart: a data acquisition and repairing tool, in Proceedings of the International Workshop on Inconsistency and Incompleteness in Databases (IIDB) (2006), pp. 297–317
S. Flesca, F. Furfaro, F. Parisi, Consistent query answers on numerical databases under aggregate constraints, in Proceedings of the International Symposium on Database Programming Languages (DBPL) (2005), pp. 279–294
S. Flesca, F. Furfaro, F. Parisi, Preferred database repairs under aggregate constraints, in Proceedings of the International Conference on Scalable Uncertainty Management (SUM) (2007), pp. 215–229
S. Flesca, F. Furfaro, F. Parisi, Consistent answers to Boolean aggregate queries under aggregate constraints, in Proceedings of the International Conference on Database and Expert Systems Applications (DEXA) (2010), pp. 285–299
S. Flesca, F. Furfaro, F. Parisi, Querying and repairing inconsistent numerical databases, ACM Trans. Database Syst. 35(2) (2010)
S. Flesca, F. Furfaro, F. Parisi, Range-consistent answers of aggregate queries under aggregate constraints, in Proceedings of the International Conference on Scalable Uncertainty Management (SUM) (2010), pp. 163–176
F. Furfaro, S. Greco, C. Molinaro, A three-valued semantics for querying and repairing inconsistent databases. Ann. Math. Artif. Intell. 51(2–4), 167–193 (2007)
M. Gelfond, V. Lifschitz, Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)
T. Gogacz, J. Marcinkowski, All-instances termination of chase is undecidable, in ICALP (2014), pp. 293–304
G. Gottlob, A. Nash, Efficient core computation in data exchange. J. ACM 55(2) (2008)
G. Grahne, A. Onet, Anatomy of the chase. CoRR arXiv:abs/1303.6682 (2013)
B.C. Grau, I. Horrocks, M. Krötzsch, C. Kupke, D. Magka, B. Motik, Z. Wang, Acyclicity notions for existential rules and their application to query answering in ontologies. JAIR 47, 741–808 (2013)
G. Greco, S. Greco, E. Zumpano, A logic programming approach to the integration, repairing and querying of inconsistent databases, in ICLP (2001), pp. 348–364
G. Greco, S. Greco, E. Zumpano, A logical framework for querying and repairing inconsistent databases. IEEE Trans. Knowl. Data Eng. 15(6), 1389–1408 (2003)
S. Greco, E. Zumpano, Computing repairs for inconsistent databases, in CODAS (2001), pp. 33–42
S. Greco, C. Molinaro, Querying and repairing inconsistent databases under three-valued semantics, in Proceedings of the International Conference on Logic Programming (ICLP) (2007), pp. 149–164
S. Greco, C. Molinaro, Approximate probabilistic query answering over inconsistent databases, in Proceedings of the International Conference on Conceptual Modeling (ER) (2008), pp. 311–325
S. Greco, F. Spezzano, Chase termination: a constraints rewriting approach. PVLDB 3(1), 93–104 (2010)
S. Greco, C. Molinaro, Probabilistic query answering over inconsistent databases. Ann. Math. Artif. Intell. 64(2–3), 185–207 (2012)
S. Greco, C. Sirangelo, I. Trubitsyna, E. Zumpano, Preferred repairs for inconsistent databases, in Proceedings of the IDEAS (2003), pp. 202–211
S. Greco, C. Molinaro, I. Trubitsyna, E. Zumpano, NP datalog: a logic language for expressing search and optimization problems. TPLP 10(2), 125–166 (2010)
S. Greco, F. Spezzano, I. Trubitsyna, Stratification criteria and rewriting techniques for checking chase termination. PVLDB 4(11), 1158–1168 (2011)
S. Greco, C. Molinaro, I. Trubitsyna, Checking logic program termination under bottom-up evaluation, in IJCAI (2013), pp. 323–333
S. Greco, C. Molinaro, I. Trubitsyna, Logic programming with function symbols: checking termination of bottom-up evaluation through program adornments. TPLP 13(4–5), 737–752 (2013)
S. Greco, F. Spezzano, I. Trubitsyna, Checking chase termination: cyclicity analysis and rewriting techniques. IEEE Trans. Knowl. Data Eng. 27(3), 621–635 (2015)
Y. Lierler, V. Lifschitz, One more decidable class of finitely ground programs, in ICLP (2009), pp. 489–493
V.W. Marek, M. Truszczynski, Revision programming. Theor. Comput. Sci. 190(2), 241–277 (1998)
V.W. Marek, I. Pivkina, M. Truszczynski, Annotated revision programs. Artif. Intell. 138(1–2), 149–180 (2002)
B. Marnette, Generalized schema-mappings: from termination to tractability, in PODS (2009), pp. 13–22
M.V. Martinez, F. Parisi, A. Pugliese, G.I. Simari, V.S. Subrahmanian, Inconsistency management policies, in Proceedings of the International Conference on Principles of Knowledge Representation and Reasoning (KR) (2008), pp. 367–377
M.V. Martinez, F. Parisi, A. Pugliese, G.I. Simari, V.S. Subrahmanian, Efficient policy-based inconsistency management in relational knowledge bases, in Proceedings of the International Conference on Scalable Uncertainty Management (SUM) (2010), pp. 264–277
M.V. Martinez, F. Parisi, A. Pugliese, G.I. Simari, V.S. Subrahmanian, Policy-based inconsistency management in relational databases. Int. J. Approx. Reason. 55(2), 501–528 (2014)
G. Mecca, P. Papotti, S. Raunich, Core schema mappings, in SIGMOD (2009), pp. 655–668
M. Meier, On the Termination of the Chase Algorithm. Albert-Ludwigs-Universitat Freiburg (Germany) (2010)
M. Meier, M. Schmidt, G. Lausen, On chase termination beyond stratification. PVLDB 2(1), 970–981 (2009)
C. Molinaro, S. Greco, Polynomial time queries over inconsistent databases with functional dependencies and foreign keys. Data Knowl. Eng. 69(7), 709–722 (2010)
C. Molinaro, J. Chomicki, J. Marcinkowski, Disjunctive databases for representing repairs. Ann. Math. Artif. Intell. 57(2), 103–124 (2009)
A. Onet, The chase procedure and its applications in data exchange, in Data Exchange, Integration, and Streams (2013), pp. 1–37
F. Parisi, J. Grant, Integrity constraints for probabilistic spatio-temporal knowledgebases, in Proceedings of the International Conference on Scalable Uncertainty Management (SUM) (2014), pp. 251–264
F. Parisi, J. Grant, Knowledge representation in probabilistic spatio-temporal knowledge bases. J. Artif. Intell. Res. (JAIR) 55, 743–798 (2016)
F. Parisi, J. Grant, On repairing and querying inconsistent probabilistic spatio-temporal databases. Int. J. Approx. Reason. (IJAR) 84, 41–74 (2017)
B. ten Cate, L. Chiticariu, P.G. Kolaitis, W.C. Tan, Laconic schema mappings: computing the core with SQL queries. PVLDB 2(1), 1006–1017 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Calautti, M. et al. (2018). Dealing with Inconsistency in Databases: An Overview. In: Flesca, S., Greco, S., Masciari, E., Saccà, D. (eds) A Comprehensive Guide Through the Italian Database Research Over the Last 25 Years. Studies in Big Data, vol 31. Springer, Cham. https://doi.org/10.1007/978-3-319-61893-7_9
Download citation
DOI: https://doi.org/10.1007/978-3-319-61893-7_9
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61892-0
Online ISBN: 978-3-319-61893-7
eBook Packages: EngineeringEngineering (R0)