article

Prioritized repairing and consistent query answering in relational databases

Authors:

Sławek Staworko,

Jerzy MarcinkowskiAuthors Info & Claims

Annals of Mathematics and Artificial Intelligence, Volume 64, Issue 2-3

Pages 209 - 246

https://doi.org/10.1007/s10472-012-9288-8

Published: 01 March 2012 Publication History

Abstract

A consistent query answer in an inconsistent database is an answer obtained in every (minimal) repair. The repairs are obtained by resolving all conflicts in all possible ways. Often, however, the user is able to provide a preference on how conflicts should be resolved. We investigate here the framework of preferred consistent query answers, in which user preferences are used to narrow down the set of repairs to a set of preferred repairs. We axiomatize desirable properties of preferred repairs. We present three different families of preferred repairs and study their mutual relationships. Finally, we investigate the complexity of preferred repairing and computing preferred consistent query answers.

References

[1]

Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison-Wesley (1995).

[2]

Afrati, F., Kolaitis, P.: Repair checking in inconsistent databases: algorithms and complexity. In: International Conference on Database Theory (ICDT), pp. 31-41. ACM (2009).

[3]

Andritsos, P., Fuxman, A., Miller, R.J.: Clean answers over dirty databases: a probabilistic approach. In: International Conference on Data Engineering (ICDE), p. 30 (2006).

[4]

Arenas, M., Bertossi, L., Chomicki, J.: Consistent query answers in inconsistent databases. In: ACM Symposium on Principles of Database Systems (PODS), pp. 68-79 (1999).

Digital Library

[5]

Arenas, M., Bertossi, L., Chomicki, J., He, X., Raghavan, V., Spinrad, J.: Scalar aggregation in inconsistent databases. Theoret. Comput. Sci. 296(3), 405-434 (2003).

Digital Library

[6]

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

Digital Library

[7]

Bertossi, L., Chomicki, J.: Query answering in inconsistent databases. In: Chomicki, J., van der Meyden, R., Saake, G. (eds.) Logics for Emerging Applications of Databases, pp. 43-83. Springer (2003).

[8]

Bertossi, L.: Database repairing and consistent query answering. Synthesis Lectures on Data Management 3(5), 1-121 (2011).

[9]

Brewka, G.: Preferred subtheories: An extended logical framework for default reasoning. In: International Joint Conference on Artificial Intelligence (IJCAI), pp. 1043-1048 (1989).

[10]

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

Digital Library

[11]

Chomicki, J.: Preference formulas in relational queries. ACM T. Database Syst. 28(4), 427-466 (2003).

Digital Library

[12]

Chomicki, J.: Consistent query answering: five easy pieces. In: International Conference on Database Theory (ICDT), pp. 1-17 (2007).

[13]

Chomicki, J., Marcinkowski, J.: Minimal-change integrity maintenance using tuple deletions. Inform. Comput. 197(1-2), 90-121 (2005).

Digital Library

[14]

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, pp. 119-150. LNCS 3300. Springer (2005).

[15]

Chomicki, J., Marcinkowski, J., Staworko, S.: Computing consistent query answers using conflict hypergraphs. In: International Conference on Information and Knowledge Management (CIKM), pp. 417-426. ACM Press (2004).

[16]

Fagin, R., Ullman, J.D., Vardi, M.Y.: On the semantics of updates in databases. In: ACM Symposium on Principles of Database Systems (PODS), pp. 352-356 (1983).

[17]

Fan, W.: Dependencies revisited for improving data quality. In: ACM Symposium on Principles of Database Systems (PODS), pp. pages 159-170 (2008).

[18]

Fuxman, A., Kolaitis, P., Miller, R., Tan, W.-C.: Peer data exchange. ACM T. Database Syst. 31(4), 1454-1498 (2006).

Digital Library

[19]

Gatterbauer, W., Suciu, D.: Data conflict resolution using trust mappings. In: ACM SIGMOD International Conference on Management of Data, pp. 219-230 (2010).

[20]

Greco, G., Lembo, D.: Data integration with preferences among sources. In: International Conference on Conceptual Modeling (ER), pp. 231-244. Springer (2004).

[21]

Greco, S., Sirangelo, C., Trubitsyna, I., Zumpano, E.: Feasibility conditions and preference criteria in quering and repairing inconsistent databases. In: International Conference on Database and Expert Systems Applications (DEXA), pp. 44-55 (2004).

[22]

Grosof, B.N.: Prioritized conflict handling for logic programs. In: International Logic Programming Symposium, pp. 197-211 (1997).

Digital Library

[23]

Halpern, J.Y.: Defining relative likehood in partially-ordered preferential structures. J. Artificial Intelligence Res. 7, 1-24 (1997).

Digital Library

[24]

Koltun, V., Papadimitriou, C.: Approximately dominating representatives. Theoret. Comput. Sci. 371(3), 148-154 (2007).

Digital Library

[25]

Martinez, M.V., Parisi, F., Pugliese, A., Simari, G.I., Subrahmanian, V.S.: Inconsistency management policies. In: International Conference on Principles of Knowledge Representation and Reasoning (KR), pp. 367-377 (2008).

[26]

Motro, A., Anokhin, P., Acar, A.C.: Utility-based resolution of data inconsistencies. In: International Workshop on Information Quality in Information Systems (IQIS), pp. 35-43. ACM (2004).

[27]

Sakama, C., Inoue, K.: Prioritized logic programming and its application to commonsense reasoning. Artif. Intell. 123, 185-222 (2000).

Digital Library

[28]

Staworko, S., Chomicki, J.: Consistent query answers in the presence of universal constraints. Inform. Syst. 35(1), 1-22 (2010).

Digital Library

[29]

Staworko, S., Chomicki, J., Marcinkowski, J.: Preference-driven querying of inconsistent relational databases. In: EDBT Workshops (IIDB), pp. 318-335. Springer (2006).

[30]

D. Van Nieuwenborgh and D. Vermeir. Preferred answer sets for ordered logic programs. In: European Conference on Logics for Artificial Intelligence (JELIA), pp. 432-443. LNCS 2424. Springer (2002).

[31]

Vardi, M.Y.: The complexity of relational query languages. In: ACM Symposium on Theory of Computing (STOC), pp. 137-146 (1982).

[32]

Wijsen, J.: Database repairing using updates. ACM T. Database Syst. 30(3), 722-768 (2005).

Digital Library

[33]

Wijsen, J.: On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases. In: ACM Symposium on Principles of Database Systems (PODS), pp. 179-190 (2010).

Cited By

Jabbour SMa YRaddaoui BDastani MSichman JAlechina NDignum V(2024)Towards a Principle-based Framework for Repair Selection in Inconsistent Knowledge BasesProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662945(907-915)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662945
Koutris POuyang XWijsen J(2024)Consistent Query Answering for Primary Keys on Rooted Tree QueriesProceedings of the ACM on Management of Data10.1145/36511392:2(1-26)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651139
Mahmood YVirtema JBarlag TNgomo A(2024)Computing Repairs Under Functional and Inclusion Dependencies via ArgumentationFoundations of Information and Knowledge Systems10.1007/978-3-031-56940-1_2(23-42)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-56940-1_2
Show More Cited By

Index Terms

Prioritized repairing and consistent query answering in relational databases
1. Information systems
  1. Data management systems
    1. Database design and models
2. Theory of computation
  1. Theory and algorithms for application domains
    1. Database theory
      1. Database query processing and optimization (theory)

Index terms have been assigned to the content through auto-classification.

Recommendations

Probabilistic query answering over inconsistent databases

This paper presents a framework for querying inconsistent databases in the presence of functional dependencies. Most of the works dealing with the problem of extracting reliable information from inconsistent databases are based on the notion of repair, ...
Consistent query answering with prioritized active integrity constraints
IDEAS '20: Proceedings of the 24th Symposium on International Database Engineering & Applications

Consistent query answering is a principled approach for querying inconsistent databases. It relies on two basic notions: the notion of a repair, that is, a consistent database that "minimally" differs from the original one, and the notion of a ...
Consistent query answers in the presence of universal constraints

The framework of consistent query answers and repairs has been introduced to alleviate the impact of inconsistent data on the answers to a query. A repair is a minimally different consistent instance and an answer is consistent if it is present in every ...

Comments

Information & Contributors

Information

Published In

cover image Annals of Mathematics and Artificial Intelligence

Annals of Mathematics and Artificial Intelligence Volume 64, Issue 2-3

March 2012

220 pages

ISSN:1012-2443

Issue’s Table of Contents

Copyright © Copyright © 2012 Springer Science+Business Media B.V.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 March 2012

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

35
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Jabbour SMa YRaddaoui BDastani MSichman JAlechina NDignum V(2024)Towards a Principle-based Framework for Repair Selection in Inconsistent Knowledge BasesProceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems10.5555/3635637.3662945(907-915)Online publication date: 6-May-2024
https://dl.acm.org/doi/10.5555/3635637.3662945
Koutris POuyang XWijsen J(2024)Consistent Query Answering for Primary Keys on Rooted Tree QueriesProceedings of the ACM on Management of Data10.1145/36511392:2(1-26)Online publication date: 14-May-2024
https://dl.acm.org/doi/10.1145/3651139
Mahmood YVirtema JBarlag TNgomo A(2024)Computing Repairs Under Functional and Inclusion Dependencies via ArgumentationFoundations of Information and Knowledge Systems10.1007/978-3-031-56940-1_2(23-42)Online publication date: 8-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-56940-1_2
Lukasiewicz TMalizia EMolinaro CMarquis PSon TKern-Isberner G(2023)Complexity of inconsistency-tolerant query answering in Datalog+/- under preferred repairsProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/46(472-481)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/46
Bienvenu MBourgaux CMarquis PSon TKern-Isberner G(2023)Inconsistency handling in prioritized databases with universal constraintsProceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning10.24963/kr.2023/10(97-106)Online publication date: 2-Sep-2023
https://dl.acm.org/doi/10.24963/kr.2023/10
Alfano GGreco SParisi FTrubitsyna IElkind E(2023)Preferences and constraints in abstract argumentationProceedings of the Thirty-Second International Joint Conference on Artificial Intelligence10.24963/ijcai.2023/345(3095-3103)Online publication date: 19-Aug-2023
https://dl.acm.org/doi/10.24963/ijcai.2023/345
Hannula MWijsen JLibkin LBarceló P(2022)A Dichotomy in Consistent Query Answering for Primary Keys and Unary Foreign KeysProceedings of the 41st ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3517804.3524157(437-449)Online publication date: 12-Jun-2022
https://dl.acm.org/doi/10.1145/3517804.3524157
Gallo FSimari GMartinez MSantos NFalappa M(2021)Local Belief Dynamics in Network Knowledge BasesACM Transactions on Computational Logic10.1145/347739423:1(1-36)Online publication date: 22-Oct-2021
https://dl.acm.org/doi/10.1145/3477394
Bertossi L(2021)Specifying and computing causes for query answers in databases via database repairs and repair-programsKnowledge and Information Systems10.1007/s10115-020-01516-663:1(199-231)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1007/s10115-020-01516-6
Cima GLembo DMarconi LRosati RSavo D(2021)Controlled Query Evaluation over Prioritized Ontologies with Expressive Data Protection PoliciesThe Semantic Web – ISWC 202110.1007/978-3-030-88361-4_22(374-391)Online publication date: 24-Oct-2021
https://dl.acm.org/doi/10.1007/978-3-030-88361-4_22
Show More Cited By

View Options

View options

Get Access

Login options

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

Full Access

Get this Publication

Media

Figures

Other

Tables

View Issue’s Table of Contents