Skip to main content

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. 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)

    Article  MathSciNet  MATH  Google Scholar 

  2. M. Calautti, S. Greco, I. Trubitsyna, Detecting decidable classes of finitely ground logic programs with function symbols, in PPDP (2013), pp. 239–250

    Google Scholar 

  3. 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

    Google Scholar 

  4. M. Calautti, G. Gottlob, A. Pieris, Chase termi- nation for guarded existential rules, in PODS (2015)

    Google Scholar 

  5. M. Calautti, S. Greco, C. Molinaro, I. Trubitsyna, Logic program termination analysis using atom sizes, in IJCAI (2015), pp. 2833–2839

    Google Scholar 

  6. M. Calautti, S. Greco, C. Molinaro, I. Trubitsyna, Exploiting equality generating dependencies in checking chase termination. PVLDB 9(5), 396–407 (2016)

    Google Scholar 

  7. M. Calautti, S. Greco, C. Molinaro, I. Trubitsyna, Using linear constraints for logic program termination analysis. TPLP 16(3), 353–377 (2016)

    MathSciNet  Google Scholar 

  8. A. Calì, G. Gottlob, M. Kifer, Taming the infinite chase: query answering under expressive relational constraints. JAIR 48, 115–174 (2013)

    MathSciNet  MATH  Google Scholar 

  9. L. Caroprese, M. Truszczynski, Active integrity constraints and revision programming. TPLP 11(6), 905–952 (2011)

    MathSciNet  MATH  Google Scholar 

  10. L. Caroprese, S. Greco, I. Trubitsyna, E. Zumpano, Preferred generalized answers for inconsistent databases, in ISMIS (2006), pp. 344–349

    Google Scholar 

  11. 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

    Google Scholar 

  12. L. Caroprese, S. Greco, E. Zumpano, Active integrity constraints for database consistency maintenance. IEEE Trans. Knowl. Data Eng. 21(7), 1042–1058 (2009)

    Article  Google Scholar 

  13. A. Deutsch, A. Nash, J.B. Remmel, The chase revisited, in PODS (2008), pp. 149–158

    Google Scholar 

  14. R. Fagin, P.G. Kolaitis, R.J. Miller, L. Popa, Data exchange: semantics and query answering. Theor. Comput. Sci. 336(1), 89–124 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  15. R. Fagin, P.G. Kolaitis, L. Popa, Data exchange: getting to the core. ACM TODS 30(1), 174–210 (2005)

    Article  MATH  Google Scholar 

  16. 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

    Google Scholar 

  17. 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

    Google Scholar 

  18. 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

    Google Scholar 

  19. 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

    Google Scholar 

  20. S. Flesca, F. Furfaro, F. Parisi, Querying and repairing inconsistent numerical databases, ACM Trans. Database Syst. 35(2) (2010)

    Google Scholar 

  21. 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

    Google Scholar 

  22. 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)

    Article  MathSciNet  MATH  Google Scholar 

  23. M. Gelfond, V. Lifschitz, Classical negation in logic programs and disjunctive databases. New Gener. Comput. 9(3/4), 365–386 (1991)

    Article  MATH  Google Scholar 

  24. T. Gogacz, J. Marcinkowski, All-instances termination of chase is undecidable, in ICALP (2014), pp. 293–304

    Google Scholar 

  25. G. Gottlob, A. Nash, Efficient core computation in data exchange. J. ACM 55(2) (2008)

    Google Scholar 

  26. G. Grahne, A. Onet, Anatomy of the chase. CoRR arXiv:abs/1303.6682 (2013)

  27. 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)

    MathSciNet  MATH  Google Scholar 

  28. 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

    Google Scholar 

  29. 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)

    Article  Google Scholar 

  30. S. Greco, E. Zumpano, Computing repairs for inconsistent databases, in CODAS (2001), pp. 33–42

    Google Scholar 

  31. 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

    Google Scholar 

  32. 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

    Google Scholar 

  33. S. Greco, F. Spezzano, Chase termination: a constraints rewriting approach. PVLDB 3(1), 93–104 (2010)

    Google Scholar 

  34. S. Greco, C. Molinaro, Probabilistic query answering over inconsistent databases. Ann. Math. Artif. Intell. 64(2–3), 185–207 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  35. S. Greco, C. Sirangelo, I. Trubitsyna, E. Zumpano, Preferred repairs for inconsistent databases, in Proceedings of the IDEAS (2003), pp. 202–211

    Google Scholar 

  36. 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)

    MATH  Google Scholar 

  37. S. Greco, F. Spezzano, I. Trubitsyna, Stratification criteria and rewriting techniques for checking chase termination. PVLDB 4(11), 1158–1168 (2011)

    Google Scholar 

  38. S. Greco, C. Molinaro, I. Trubitsyna, Checking logic program termination under bottom-up evaluation, in IJCAI (2013), pp. 323–333

    Google Scholar 

  39. 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)

    MathSciNet  MATH  Google Scholar 

  40. S. Greco, F. Spezzano, I. Trubitsyna, Checking chase termination: cyclicity analysis and rewriting techniques. IEEE Trans. Knowl. Data Eng. 27(3), 621–635 (2015)

    Article  Google Scholar 

  41. Y. Lierler, V. Lifschitz, One more decidable class of finitely ground programs, in ICLP (2009), pp. 489–493

    Google Scholar 

  42. V.W. Marek, M. Truszczynski, Revision programming. Theor. Comput. Sci. 190(2), 241–277 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  43. V.W. Marek, I. Pivkina, M. Truszczynski, Annotated revision programs. Artif. Intell. 138(1–2), 149–180 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  44. B. Marnette, Generalized schema-mappings: from termination to tractability, in PODS (2009), pp. 13–22

    Google Scholar 

  45. 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

    Google Scholar 

  46. 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

    Google Scholar 

  47. 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)

    Article  MathSciNet  MATH  Google Scholar 

  48. G. Mecca, P. Papotti, S. Raunich, Core schema mappings, in SIGMOD (2009), pp. 655–668

    Google Scholar 

  49. M. Meier, On the Termination of the Chase Algorithm. Albert-Ludwigs-Universitat Freiburg (Germany) (2010)

    Google Scholar 

  50. M. Meier, M. Schmidt, G. Lausen, On chase termination beyond stratification. PVLDB 2(1), 970–981 (2009)

    Google Scholar 

  51. C. Molinaro, S. Greco, Polynomial time queries over inconsistent databases with functional dependencies and foreign keys. Data Knowl. Eng. 69(7), 709–722 (2010)

    Article  Google Scholar 

  52. C. Molinaro, J. Chomicki, J. Marcinkowski, Disjunctive databases for representing repairs. Ann. Math. Artif. Intell. 57(2), 103–124 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  53. A. Onet, The chase procedure and its applications in data exchange, in Data Exchange, Integration, and Streams (2013), pp. 1–37

    Google Scholar 

  54. 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

    Google Scholar 

  55. F. Parisi, J. Grant, Knowledge representation in probabilistic spatio-temporal knowledge bases. J. Artif. Intell. Res. (JAIR) 55, 743–798 (2016)

    MathSciNet  MATH  Google Scholar 

  56. F. Parisi, J. Grant, On repairing and querying inconsistent probabilistic spatio-temporal databases. Int. J. Approx. Reason. (IJAR) 84, 41–74 (2017)

    Article  MathSciNet  Google Scholar 

  57. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francesco Parisi .

Editor information

Editors and Affiliations

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics