skip to main content
article

Consistent query answering in databases

Published:01 June 2006Publication History
Skip Abstract Section

Abstract

For several reasons databases may become inconsistent with respect to a given set of integrity constraints (ICs): (a) The DBMS have no mechanism to maintain certain classes of ICs. (b) New constraints are imposed on preexisting, legacy data. (c) The ICs are soft, user, or informational constraints that are considered at query time, but without being necessarily enforced. (d) Data from different and autonomous sources are being integrated, in particular in mediator-based approaches.

References

  1. Arenas, M., Bertossi, L. and Chomicki, J. Consistent Query Answers in Inconsistent Databases. Proc. ACM Symposium on Principles of Database Systems (PODS), ACM Press, 1999, pp. 68--79.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Arenas, M., Bertossi, L. and Chomicki, J. Scalar Aggregation in FD-Inconsistent Databases. Proc. International Conference on Database Theory (ICDT 01), Springer LNCS 1973, 2001, pp. 39--53.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V. and Spinrad, J. Scalar Aggregation in Inconsistent Databases. Theoretical Computer Science, 2003, 296(3):405--434.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Arenas, M., Bertossi, L. and Chomicki, J. Answer Sets for Consistent Query Answering in Inconsistent Databases. Theory and Practice of Logic Programming, 3(4-5):393--424, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Barcelo, P. and Bertossi, L. Logic Programs for Querying Inconsistent Databases. Proc. Practical Aspects of Declarative Languages (PADL 03), Springer LNCS 2562, 2003, pp. 208--222.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Barcelo, P., Bertossi, L. and Bravo, L. Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets. In Semantics of Databases, Springer LNCS 2582, 2003, pp. 1--27.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Bertossi, L., Chomicki, J., Cortes, A. and Gutierrez, C. Consistent Answers from Integrated Data Sources. Proc. Flexible Query Answering Systems (FQAS 02), Springer LNCS 2522, 2002, pp. 71--85.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Bertossi, L. and Bravo, L. Consistent Query Answers in Virtual Data Integration Systems. In Inconsistency Tolerance, Springer LNCS 3300, 2004, pp. 42--83.]]Google ScholarGoogle Scholar
  9. Bertossi, L. and Bravo, L. Query Answering in Peer-to-Peer Data Exchange Systems. Proc. EDBT International Workshop on Peer-to-Peer Computing & DataBases (P2P&DB 04), Springer LNCS 3268, 2004, pp. 478--485.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Bertossi, L., Bravo, L., Franconi, E. and Lopatenko, A. Fixing Numerical Attributes under Integrity Constraints. Proc. International Symposium on Database Programming Languages (DBPL 05), Springer LNCS 3774, 2005, pp. 262--278.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Bertossi, L., Chomicki, J., Godfrey, P., Kolaitis, Ph., Thomo, A. and Zuzarte, C. Exchange, Integration, and Consistency of Data: Report on the ARISE/NISR Workshop. SIGMOD Record, 2005, 34(3):87--90.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Bertossi, L. and Chomicki, J. Query Answering in Inconsistent Databases. In Logics for Emerging Applications of Databases. Springer, 2003, pp. 43--83.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Bravo, L. and Bertossi, L. Logic Programs for Consistently Querying Data Integration Systems. Proc. International Joint Conference in Artificial Intelligence (IJ-CAI 03), Morgan Kauffmann Publishers, 2003, pp. 10--15.]]Google ScholarGoogle Scholar
  14. Bravo, L. and Bertossi, L. Disjunctive Deductive Databases for Computing Certain and Consistent Answers to Queries from Mediated Data Integration Systems. Journal of Applied Logic, 2005, 3(2):329--367.]]Google ScholarGoogle ScholarCross RefCross Ref
  15. Bravo, L. and Bertossi, L. Semantically Correct Query Answers in the Presence of Null Values. Proc. EDBT International Workshop on Inconsistency and Incompleteness in Databases (IIDB 06). To appear in Springer LNCS. Technical Report arXiv:cs.DB/0604076 v1. Posted April 19, 2006.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Cali, A., Calvanese, D., De Giacomo, G. and Lenzerini, M. Data Integration Under Integrity Constraints. In Proc. Conference on Advanced Information Systems Engineering (CAISE 02), Springer LNCS 2348, 2002, pp. 262--279.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Cali, A., Calvanese, D., De Giacomo, G. and Lenzerini, M. On the Role of Integrity Constraints in Data Integration. IEEE Data Engineering Bulletin, 2002, 25(3): 39--45.]]Google ScholarGoogle Scholar
  18. Cali, A., Lembo, D. and Rosati, R. On the Decidability and Complexity of Query Answering over Inconsistent and Incomplete Databases. Proc. ACM Symposium on Principles of Database Systems (PODS), ACM Press, 2003, pp. 260--271.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M. and Rosati, R. Inconsistency Tolerance in P2P Data Integration: An Epistemic Logic Approach. Proc. International Symposium on Database Programming Languages (DBPL 05), Springer LNCS 3774, 2005, pp. 90--105.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Caniupan, M. and Bertossi, L. Optimizing Repair Programs for Consistent Query Answering. Proc. International Conference of the Chilean Computer Science Society (SCCC 05), IEEE Computer Society Press, 2005, pp. 3--12.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Celle, A. and Bertossi, L. Querying Inconsistent Databases: Algorithms and Implementation. In Computational Logic - CL 2000, Springer LNCS 1861, 2000, pp. 942--956.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Chomicki, J., Marcinkowski, J. and Staworko, S. Computing Consistent Query Answers using Conflict Hypergraphs. Proc. Conference on Information and Knowledge Management (CIKM 04), ACM Press, 2004, pp. 417--426.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Chomicki, J. and Marcinkowski, J. Minimal-Change Integrity Maintenance Using Tuple Deletions. Information and Computation, 197(1-2):90--121, 2005.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A. Complexity and Expressive Power of Logic Programming. ACM Computing Surveys, 2001, 33(3): 374--425.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Downey, R. G. and Fellows, M. R. Parameterized Complexity. Springer, Monographs in Computer Science, 1999.]]Google ScholarGoogle Scholar
  26. Duschka, O., Genesereth, M. and Levy, A. Recursive Query Plans for Data Integration. Journal of Logic Programming, 2000, 43(1):49--73.]]Google ScholarGoogle ScholarCross RefCross Ref
  27. Eiter, T., Fink, M., Greco, G. and Lembo, D. Efficient Evaluation of Logic Programs for Querying Data Integration Systems. Proc. International Conference on Logic Programming (ICLP 03), Springer LNCS 2916, 2003, pp. 163--177. 2916, 2003.]]Google ScholarGoogle ScholarCross RefCross Ref
  28. Fagin, R., Kolaitis, Ph. G., Miller, R. J., and Popa, L. Data Exchange: Semantics and Query Answering. Proc. International Conference on Database Theory (ICDT). 207--224, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Flesca, S., Furfaro, F. Parisi, F. Consistent Query Answers on Numerical Databases under Aggregate Constraints. Proc. International Symposium on Database Programming Languages (DBPL 05), Springer LNCS 3774, 2005, pp. 279--294.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. Flum, J. and Grohe, M. Parameterized Complexity Theory. Springer, Texts in Theoretical Computer Science, 2006.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Franconi, E., Laureti Palma, A., Leone, N., Perri, S. and Scarcello, F. Census Data Repair: a Challenging Application of Disjunctive Logic Programming. Proc. Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 01). Springer LNCS 2250, 2001, pp. 561--578.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Fuxman, A. and Miller, R. First-Order Query Rewriting for Inconsistent Databases. Proc. International Conference on Database Theory (ICDT 05), Springer LNCS 3363, 2004, pp. 337--351.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. Fuxman, A., Fazli, E. and Miller, R. J. ConQuer: Efficient Management of Inconsistent Databases. Proc. ACM International Conference on Management of Data (SIGMOD 05), ACM Press, 2005, pp. 155--166.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Gelfond, M. and Lifschitz, V. Classical Negation in Logic Programs and Disjunctive Databases. New Generation Computing, 1991, 9:365--385.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  35. Greco, G., Greco, S. and Zumpano, E. A Logical Framework for Querying and Repairing Inconsistent Databases. IEEE Transactions on Knowledge and Data Engineering, 15(6):1389--1408, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  36. Giannotti, F., Greco, S., Sacca, D. and Zaniolo, C. Programming with Non-determinism in Deductive Databases. Annals of Mathematics and Artificial Intelligence, 1997, 19(1--2):97--125.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. Grieco, L., Lembo, D., Rosati, R. and Ruzzi, M. Consistent Query Answering under Key and Exclusion Dependencies: Algorithms and Experiments. Proc. ACM International conference on Information and Knowledge Management (CIKM 05), ACM Press, 2005, pp. 792--799.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. Grohe, M. Parameterized Complexity for the Data-base Theorist. SIGMOD Record, 2002, 31(4):86--96.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. Halevy, A., Ives, Z., Suciu, D. and Tatarinov, I. Schema Mediation in Peer Data Management Systems. Proc. Intenational Conference on Data Engineering (ICDE 03), IEEE Computer Society Press, 2003, pp. 505--518.]]Google ScholarGoogle ScholarCross RefCross Ref
  40. Immerman, N. Descriptive Complexity. Graduate Texts in Computer Science. Springer, 1999.]]Google ScholarGoogle Scholar
  41. Kolaitis, Ph. Schema Mappings, Data Exchange, and Metadata Management. Proc. ACM Symposium on Principles of Database Systems (PODS 05), ACM Press, 2005, pp. 61--75.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. Lembo, D., Lenzerini, M. and Rosati, R. Source Inconsistency and Incompleteness in Data Integration. In Proc. International Workshop Knowledge Representation meets Databases (KRDB 02), CEUR Electronic Workshop Proceedings, 2002.]]Google ScholarGoogle Scholar
  43. Lenzerini, M. Data Integration: A Theoretical Perspective. Proc. ACM Symposium on Principles of Database Systems (PODS 02), ACM Press, 2002, pp. 233--246]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Lopatenko, A. and Bertossi, L. Complexity of Consistent Query Answering in Databases under Cardinality-Based and Incremental Repair Semantics. Technical Report arXiv:cs.DB/0604002 v1. Posted April 2, 2006.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. Miltersen, P. B., Subramanian, S., Vitter, J. S. and Tamassia, R. Complexity Models for Incremental Computation. Theoretical Computer Science, 1994, 130(1):203--236.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. Niedermeier, R. and Rossmanith, P. An Efficient Fixed-Parameter Algorithm for 3-Hitting Set. Journal of Discrete Algorithms, 2003, 1(1):89--102.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. Weber, V. and Schwentick, T. Dynamic Complexity Theory Revisited. Proc. Annual Symposium on Theoretical Aspects of Computer Science (STACS 05), Springer LNCS 3404, 2005, pp. 256--268.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. Wijsen, J. Condensed Representation of Database Repairs for Consistent Query Answering. Proc. International Conference on Database Theory (ICDT), pages 378--393. Springer-Verlag, LNCS 2572, 2003.]] Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Consistent query answering in databases

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              Full Access

              • Published in

                cover image ACM SIGMOD Record
                ACM SIGMOD Record  Volume 35, Issue 2
                June 2006
                83 pages
                ISSN:0163-5808
                DOI:10.1145/1147376
                Issue’s Table of Contents

                Copyright © 2006 Author

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 1 June 2006

                Check for updates

                Qualifiers

                • article

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader