Skip to main content
SpringerLink
Log in

Study on consistent query answering in inconsistent databases

  • Review Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Consistent query answering is an approach to retrieving consistent answers over databases that might be inconsistent with respect to some given integrity constraints. The approach is based on a concept of repair. This paper surveys several recent researches on obtaining consistent information from inconsistent databases, such as the underlying semantic model, a number of approaches to computing consistent query answers and the computational complexity of this problem. Furthermore, the work outlines potential research directions in this area.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dasu T, Johnson T. Exploratory Data Mining and Data Cleaning. New York: John Wiley, 2003

    MATH  Google Scholar 

  2. Arenas M, Bertossi L, Chomicki J. Consistent query answers in inconsistent databases. In: Proceedings of ACM Symposium on Principles of Database Systems. New York: ACM Press, 1999, 68–79

    Google Scholar 

  3. Celle A, Bertossi L. Querying inconsistent databases: algorithms and implementation. In: Proceedings of International Conference on Computational Logic. Berlin: Springer, 2000, 942–956

    Google Scholar 

  4. Fuxman A, Miller R J. First-order query rewriting for inconsistent databases. In: Proceedings of International Conference on Database Theory. Berlin: Springer, 2005, 337–351

    Google Scholar 

  5. Transaction Processing Performance Council. TPC Benchmark H (Decision support) standard specification. http://www.tpc.org/tpch/default.asp

  6. Fuxman A, Fuxman D, Miller R J. ConQuer: a system for efficient query answering over inconsistent databases. In: Proceedings of International Conference on Very Large Databases. New York: ACM Press, 2005, 1354–1357

    Google Scholar 

  7. Fuxman A, Miller R J. ConQuer: efficient management of inconsistent databases. In: Proceedings of International Conference on Management of Data. New York: ACM Press, 2005, 155–166

    Google Scholar 

  8. Fuxman A, Miller R J. Towards inconsistency management in data integration systems. In: Proceedings of Workshop on Information Integration on the Web. Acapulco: Morgan Kaufmann Publishers, 2003, 143–148

    Google Scholar 

  9. Chomicki J, Marcinkowski J, Staworko S. Computing consistent query answers using conflict hypergraphs. In: Proceedings of International Conference on Information and Knowledge Management. New York: ACM Press, 2004, 417–426

    Google Scholar 

  10. Chomicki J, Marcinkowski J. Minimal-change integrity maintenance using tuple deletions. Information and Computation, 2005, 197(1–2): 90–121

    Article  MATH  MathSciNet  Google Scholar 

  11. Arenas M, Bertossi L, Kifer M. Applications of annotated predicate calculus to querying inconsistent databases. In: Proceedings of the International Conference on Computational Logic. Berlin: Springer, 2000, 926–941

    Google Scholar 

  12. Barcel’o P, Bertossi L. Repairing databases with annotated predicate logic. In: Benferhat S, Giunchiglia E, eds. Proceedings of the International Workshop on Non-Monotonic Reasoning, Special Session: Changing and Integrating Information. Toulouse: Morgan Kaufmann Publishers, 2002, 160–170

    Google Scholar 

  13. Barcel’o P, Bertossi L. Logic programs for querying inconsistent databases. In: Proceedings of the International Symposium on Practical Aspects of Declarative Languages. Berlin: Springer, 2003, 208–222

    Chapter  Google Scholar 

  14. Greco G, Greco S, Zumpano E. A logic programming approach to the integration, repairing and querying of inconsistent databases. In: Proceedings of International Conference on Logic Programming. Berlin: Springer, 2001, 348–364

    Google Scholar 

  15. Greco S, Zumpano E. Querying inconsistent databases. In: Proceedings of International Conference on Logic for Programming, Artificial Intelligence, and Reasoning. Berlin: Springer, 2000, 308–325

    Google Scholar 

  16. Nieuwenborgh D V, Vermeir D. Preferred answer sets for ordered logic programs. In: Proceedings of European Conference on Logics for Artificial Intelligence. Berlin: Springer, 2002, 432–443

    Chapter  Google Scholar 

  17. Eiter T, Faber W, Leone N, et al. Declarative problem-solving in DLV. In: Minker J, ed. Logic-Based Artificial Intelligence. Boston: Kluwer Academic Publishers, 2000, 79–103

    Google Scholar 

  18. Simons P, Niemel Äa I, Soininen T. Extending and implementing the stable model semantics. Artificial Intelligence, 2002, 138(1–2): 181–234

    Article  MATH  MathSciNet  Google Scholar 

  19. Eiter T, Fink M, Greco G, et al. Efficient evaluation of logic programs for querying data integration systems. In: Proceedings of International Conference on Logic Programming. Berlin: Springer, 2003, 163–177

    Google Scholar 

  20. Arenas M, Bertossi L, Chomicki J, et al. Scalar aggregation in inconsistent databases. Theoretical Computer Science, 2003, 296(3): 405–434

    Article  MATH  MathSciNet  Google Scholar 

  21. Chomicki J, Marcinkowski J. On the computational complexity of minimal-change integrity maintenance in relational databases. In: Bertossi L, Hunter A, Schaub T, eds. Inconsistency Tolerance. Berlin: Springer, 2004, 119–150

    Google Scholar 

  22. Cal’ı A, Lembo D, Rosati R. On the decidability and complexity of query answering over inconsistent and incomplete databases. In: Proceedings of ACM Symposium on Principles of Database Systems. New York: ACM Press, 2003, 260–271

    Google Scholar 

  23. Chomicki J. Consistent query answering: five easy pieces. In: Proceedings of International Conference on Database Theory. Berlin: Springer, 2007, 1–17

    Google Scholar 

  24. Staworko S, Chomicki J, Marcinkowski J. Priority-based conflict resolution in inconsistent relational databases. In: Chomicki J, Wijsen J, eds. Proceedings of EDBT Workshop on Inconsistency and Incompleteness of Data. Berlin: Springer, 2006, 318–335

    Google Scholar 

  25. Greco S, Sirangelo C, Trubitsyna I, et al. Preferred repairs for inconsistent databases. In: Proceedings of International Conference on Database and Expert Systems Applications. Zaragoza: IEEE Computer Society Press, 2004, 44–55

    Google Scholar 

  26. Bertossi L, Bravo L, Franconi E, et al. Complexity and approximation of fixing numerical attributes in databases under integrity constraints. In: Proceedings of International Workshop on Database Programming Languages. Berlin: Springer, 2005, 262–278

    Chapter  Google Scholar 

  27. Bohannon P, Flaster M, Fan W, et al. A cost-based model and effective heuristic for repairing constraints by value modification. In: Proceedings of International Conference on Management of Data. New York: ACM Press, 2005, 143–154

    Google Scholar 

  28. Wijsen J. Database repairing using updates. ACM Transactions on Database Systems, 2005, 30(3): 722–768

    Article  Google Scholar 

  29. Wijsen J. Project-join repair: an approach to consistent query answering under functional dependencies. In: Proceedings of International Conference on Flexible Query Answering Systems. Berlin: Springer, 2006, 1–12

    Chapter  Google Scholar 

  30. Arenas M, Bertossi L, Chomicki J. Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming, 2003, 3(4–5): 393–424

    Article  MATH  MathSciNet  Google Scholar 

  31. Leone N, Pfeifer G, Faber W, et al. The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic, 2006, 7(3): 499–562

    Article  MathSciNet  Google Scholar 

  32. Buccafurri F, Leone N, Rullo P. Enhancing disjunctive datalog by constraints. IEEE Transactions on Knowledge and Data Engineering, 2000, 12(5): 845–860

    Article  Google Scholar 

  33. Meyden R V. Logical approaches to incomplete information: a survey. In: Chomicki J, Saake G, eds. Logics for Databases and Information Systems. Boston: Kluwer Academic Publishers, 1998, 307–356

    Google Scholar 

  34. Bravo L, Bertossi L. Semantically correct query answers in the presence of null values. In: Chomicki J, Wijsen J, eds. Proceedings of EDBT Workshop on Inconsistency and Incompleteness of Data. Berlin: Springer, 2006, 336–357

    Google Scholar 

  35. Andritsos P, Fuxman A, Miller R J. Clean answers over dirty databases: a probabilistic approach. In: Proceedings of IEEE International Conference on Data Engineering. Georgia: IEEE Computer Society Press, 2006, 30

    Google Scholar 

  36. Arenas M, Bertossi L, Chomicki J. Scalar aggregation in FD-inconsistent databases. In: Proceedings of International Conference on Database Theory. Berlin: Springer, 2001, 39–53

    Google Scholar 

  37. Bertossi L. Consistent query answering in databases. SIGMOD Record, 2006, 35(2): 68–76

    Article  Google Scholar 

  38. Bertossi L, Chomicki J. Query answering in inconsistent databases. In: Chomicki J, ed. Logics for Emerging Applications of Databases. Berlin: Springer, 2003, 43–83

    Google Scholar 

  39. Chomicki J. Consistent query answering: opportunities and limitations. In: Proceedings of DEXA Workshops. Krakow: IEEE Computer Society Press, 2006, 527–531

    Google Scholar 

  40. Staworko S, Chomicki J. Validity-sensitive querying of XML databases. In: Chomicki J, Wijsen J, eds. Proceedings of EDBT Workshop on Inconsistency and Incompleteness of Data. Berlin: Springer, 2006, 164–177

    Google Scholar 

  41. Flesca S, Furfaro F, Greco S, et al. Querying and repairing inconsistent XML data. In: Proceedings of International Conference on Web Information Systems Engineering. Berlin: Springer, 2005, 175–188

    Google Scholar 

  42. Fan W, Simeon J. Integrity constraints for XML. Journal of Computer and System Sciences, 2003, 66(1): 254–201

    Article  MATH  MathSciNet  Google Scholar 

  43. Bertossi L, Bravo L. Consistent query answers in virtual data integration systems. In: Bertossi L, Hunter A, Schaub T, eds. Inconsistency Tolerance. Berlin: Springer, 2004, 42–83

    Google Scholar 

  44. Bertossi L, Bravo L. Logic programs for consistently querying data integration systems. In: Gottlob G, Walsh T, eds. Proceedings of International Joint Conference on Artificial Intelligence. Acapulco: Morgan Kaufmann Publishers, 2003, 10–15

    Google Scholar 

  45. Calvanese D, Giacomo G D, Lembo D, et al. Inconsistency tolerance in P2P data integration: an epistemic logic approach. In: Proceedings of International Workshop on Database Programming Languages. Berlin: Springer, 2005, 90–105

    Chapter  Google Scholar 

  46. Fagin R, Kolaitis P G, Miller R J, et al. Data exchange: semantics and query answering. Theoretical Computer Science, 2005, 336(1): 89–124

    Article  MATH  MathSciNet  Google Scholar 

  47. Batini C, Scannapieco M. Data Quality: Concepts, Methodologies and Techniques. Berlin: Springer, 2006

    MATH  Google Scholar 

  48. Lopatenko A, Bertossi L. Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics. In: Proceedings of International Conference of Database Theory. Berlin: Springer, 2007, 179–193

    Google Scholar 

  49. Weber V, Schwentick T. Dynamic complexity theory revisited. In: Proceedings of Annual Symposium on Theoretical Aspects of Computer Science. Berlin: Springer, 2005, 256–268

    Google Scholar 

  50. Miltersen P B, Subramanian S, Vitter J S, et al. Complexity models for incremental computation. Theoretical Computer Science, 1994, 130(1): 203–236

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Science and Engineering, Central South University, Changsha, 410083, China

    Xie Dong & Yang Luming

Authors
  1. Xie Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yang Luming
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xie Dong.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Xie, D., Yang, L. Study on consistent query answering in inconsistent databases. Front. Comput. Sc. China 1, 493–501 (2007). https://doi.org/10.1007/s11704-007-0048-6

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-007-0048-6

Keywords

Search

Navigation