article

The consistency extractor system: Answer set programs for consistent query answering in databases

Authors:

Monica Caniupán,

Leopoldo BertossiAuthors Info & Claims

Data & Knowledge Engineering, Volume 69, Issue 6

Pages 545 - 572

https://doi.org/10.1016/j.datak.2010.01.005

Published: 01 June 2010 Publication History

Abstract

We describe the Consistency Extractor System (Cons Ex) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with respect to certain integrity constraints. In order to solve this task, Cons Ex uses answers set programming. More precisely, Cons Ex uses disjunctive logic programs with stable models semantics to specify and reason with the repairs, i.e. with the consistent virtual instances that minimally depart from the original database. The consistent information is invariant under all repairs. Cons Ex achieves efficient query evaluation by implementing magic sets techniques. We describe the general methodology, its optimizations for query answering, and the architecture of the system. We also present encouraging experimental results.

References

[1]

S. Abiteboul, O. Duschka, Complexity of answering queries using materialized views, in: Proceedings of the ACM Symposium on Principles of Database Systems (PODS'98), 1998, pp. 254-263.

[2]

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

Digital Library

[3]

K.R. Apt, H.A. Blair, A. Walker, Towards a theory of declarative knowledge, 1988, Ch. Foundations of Deductive Databases and Logic Programming, pp. 89-148.

[4]

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

[5]

Arenas, M., Bertossi, L. and Chomicki, J., Answer sets for consistent query answering in inconsistent databases. Theory and Practice of Logic Programming. v3 i4-5. 393-424.

[6]

F. Bancilhon, D. Maier, Y. Sagiv, J.D. Ullman, Magic sets and other strange ways to implement logic programs (extended abstract), in: Proceedings of the ACM Symposium on Principles of Database Systems (PODS'86), 1986, pp. 1-15.

Digital Library

[7]

C. Beeri, R. Ramakrishnan, On the power of magic, in: Proceedings of the ACM Symposium on Principles of Database Systems (PODS'87), 1987, pp. 269-284.

Digital Library

[8]

Barceló, P. and Bertossi, L., Logic Programs for Querying Inconsistent Databases. In: Proceedings of the International Symposium on Practical Aspects of Declarative Languages (PADL'03), vol. 2562. Springer LNCS. pp. 208-222.

[9]

Barceló, P., Bertossi, L. and Bravo, L., Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets. In: Semantics in Databases, vol. 2582. Springer LNCS. pp. 1-27.

[10]

Bertossi, L. and Chomicki, J., Logics for Emerging Applications of Databases. 2003. Springer.

[11]

Bertossi, L., Bravo, L., Franconi, E. and Lopatenko, A., Complexity and approximation of fixing numerical attributes in databases under integrity constraints. In: Proceedings of the International Symposium on Database Programming Languages (DBPL'05), vol. 3774. Springer LNCS. pp. 262-278.

[12]

Bertossi, L., Consistent query answering in databases. ACM Sigmod Record (database principles column). v2 i35. 68-76.

[13]

L. Bertossi, L. Bravo, M. Caniupan, Consistent Query Answering in Data Warehouses, in: Proceedings of the III Alberto Mendelzon International Workshop on Foundations of Data Management (AMW'09), vol. 450, 2009, Arequipa, Peru.

[14]

P. Bohannon, W. Fan, M. Flaster, R. Rastogi, A cost-based model and effective heuristic for repairing constraints by value modification, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'05), 2005, pp. 143-154.

Digital Library

[15]

L. Bravo, L. Bertossi, Consistent query answering under inclusion dependencies, in: H. Lutfiyya, J. Singer, D.A. Stewart (Eds.), 14th Annual IBM Centers for Advanced Studies Conference (CASCON'04), IBM, 2004, pp. 202-216.

[16]

Bravo, L. and Bertossi, L., Semantically correct query answers in the presence of null values. In: Proceedings of the EDBT WS on Inconsistency and Incompleteness in Databases (IIDB'06), vol. 4254. Springer LNCS. pp. 336-357.

[17]

L. Bravo, Handling Inconsistency in Databases and Data Integration Systems, Ph.D. thesis, Carleton University (2007). <http://homepages.inf.ed.ac.uk/lbravo/Publications.htm>.

[18]

Brewka, G., Preferences in answer set programming. In: Current Topics in Artificial Intelligence, vol. 4177. Springer LNCS. pp. 1-10.

[19]

A. Cali, D. Lembo, R. Rosati, On the decidability and complexity of query answering over inconsistent and incomplete databases, in: Proceedings of the ACM Symposium on Principles of Database Systems (PODS'03), 2003, pp. 260-271.

[20]

A. Cali, G. Gottlob, T. Lukasiewicz, A general datalog-based framework for tractable query answering over ontologies, in: Proceedings of the ACM Symposium on Principles of Database Systems (PODS'09), 2009, pp. 77-86.

Digital Library

[21]

Caniupan, M. and Bertossi, L., Optimizing repair programs for consistent query answering. In: Proceedings of the XXV International Conference on The Chilean Computer Science Society (SCCC'05), IEEE Computer Society. pp. 3-12.

[22]

Caniupan, M. and Bertossi, L., The consistency extractor system: querying inconsistent databases using answer set programs. In: Proceedings of the International Conference on Scalable Uncertainty Management (SUM'07), vol. 4774. Springer LNCS. pp. 74-88.

[23]

M. Caniupan, Optimizing And Implementing Repair Programs for Consistent Query Answering In Databases, Ph.D. thesis, School of Computer Science, Carleton University, 2007. <http://www.face.ubiobio.cl/~mcaniupa/publications.htm>.

[24]

Caroprese, L., Greco, S. and Zumpano, E., Ester, Active integrity constraints for database consistency maintenance. IEEE Transactions on Knowledge and Data Engineering. v21 i7. 1042-1058.

[25]

Celle, A. and Bertossi, L., Querying inconsistent databases: algorithms and implementation. In: Proceedings of the International Conference on Computational Logic (CL'00), vol. 1861. Springer, LNAI. pp. 942-956.

[26]

Ceri, S., Gottlob, G. and Tanca, L., Logic Programming and Databases. 1990. Springer-Verlag New York, Inc., New York, NY, USA.

[27]

Chomicki, J. and Marcinkowski, J., Minimal-change integrity maintenance using tuple deletions. Information and Computation. v197 i1-2. 90-121.

[28]

Chomicki, J., Consistent query answering: five easy pieces. In: Proceedings of the International Conference on Database Theory (ICDT'07), vol. 4353. Springer LNCS. pp. 1-17.

[29]

Cumbo, C., Faber, W., Greco, G. and Leone, N., Enhancing the magic-set method for disjunctive datalog programs. In: Proceedings of the 20th International Conference on Logic Programming (ICLP'04), vol. 3132. Springer LNCS. pp. 371-385.

[30]

Dantsin, E., Eiter, T., Gottlob, G. and Voronkov, A., Complexity and expressive power of logic programming. ACM Computing Surveys. v33 i3. 374-425.

[31]

Eiter, T. and Gottlob, G., On the computational cost of disjunctive logic programming: propositional case. Journal Annals of Mathematics and Artificial Intelligence. v15 i3-4. 257-456.

[32]

Eiter, T., Fink, M., Greco, G. and Lembo, D., Efficient evaluation of logic programs for querying data integration systems. In: Proceedings of the International Conference on Logic Programming (ICLP'03), vol. 2916. Springer LNCS. pp. 163-177.

[33]

Eiter, T., Faber, W., Leone, N. and Pfeifer, G., Computing preferred answer sets by meta-interpretation in answer set programming. Theory and Practice of Logic Programs. v3 i4-5. 463-498.

[34]

Eiter, T., Gottlob, G. and Mannila, H., Disjunctive datalog. ACM Transactions on Database Systems. v22 i3. 364-418.

[35]

Faber, W., Greco, G. and Leone, N., Magic sets and their application to data integration. Journal of Computer and System Sciences. v73 i4. 584-609.

[36]

Fagin, R., Kolaitis, P., Miller, R. and Popa, L., Data exchange: semantics and query answering. Theoretical Computer Science Volume. v336 i1. 89-124.

[37]

Franconi, E., Laureti-Palma, A., Leone, N., Perri, S. and Scarcello, F., Census data repair: a challenging application of disjunctive logic programming. In: Proceedings of the International Conference on Logic for Programming Artificial Intelligence and Reasoning (LPAR'01), vol. 2250. Springer LNCS. pp. 561-578.

[38]

A. Fuxman, E. Fazli, R.J. Miller, ConQuer: efficient management of inconsistent databases, in: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD'05), 2005, pp. 155-166.

[39]

Fuxman, A. and Miller, R.J., First-order query rewriting for inconsistent databases. Journal of Computer and System Sciences. v73 i4. 610-635.

[40]

Gelfond, M. and Lifschitz, V., Classical negation in logic programs and disjunctive databases. New Generation Computing. v9 i3/4. 365-386.

[41]

Gelfond, M. and Leone, N., Logic programming and knowledge representation: the a-prolog perspective. Artificial Intelligence. v138 i1-2. 3-38.

[42]

Greco, S., Binding propagation techniques for the optimization of bound disjunctive queries. IEEE Transactions on Knowledge and Data Engineering. v15 i2. 368-385.

[43]

Greco, G., Greco, S. and Zumpano, E., A logical framework for querying and repairing inconsistent databases. IEEE Transactions on Knowledge and Data Engineering. v15 i6. 1389-1408.

[44]

Greco, G., Greco, S., Trubitsyna, I. and Zumpano, E., Optimization of bound disjunctive queries with constraints. Theory Pract. Log. Program. v5 i6. 713-745.

[45]

S. Kolahi, L.V.S. Lakshmanan, On approximating optimum repairs for functional dependency violations, in: Proceedings of the International Conference on Database Theory (ICDT'09), 2009, pp. 53-62.

Digital Library

[46]

Lembo, D., Rosati, R. and Ruzzi, M., On the first-order reducibility of unions of conjunctive queries over inconsistent databases. In: Proceedings of Current Trends in Database Technology (EDBT'06), vol. 4254. Springer LNCS. pp. 358-374.

[47]

Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Koch, C., Mateis, C., Perri, S. and Scarcello, F., The DLV system for knowledge representation and reasoning. ACM Transactions on Computational Logic. v7 i3. 499-562.

[48]

V. Lifschitz, H. Turner, Splitting a logic program, in: Proceedings of the International Conference on Logic Programming (ICLP'94), 1994, pp. 23-37.

[49]

Lloyd, J.W., Foundations of Logic Programming. 1987. Springer Verlag.

[50]

Lopatenko, A. and Bertossi, L., Complexity of consistent query answering in databases under cardinality-based and incremental repair semantics. In: Proceedings of the International Conference of Database Theory (ICDT'07), vol. 4353. Springer LNCS. pp. 179-193.

[51]

C. Molinaro, J. Chomicki, J. Marcinkowski, Disjunctive databases for representing repairs, Annals of Mathematics and Artificial Intelligence, preprint 0811.2117v1, in press.

[52]

T.C. Przymusinski, On the declarative semantics of deductive databases and logic programs, 1988, pp. 193-216.

[53]

Przymusinski, T.C., Stable semantics for disjunctive programs. New Generation Computing. v9. 401-424.

[54]

Reiter, R., Towards a logical reconstruction of relational database theory. In: Brodie, M.L., Mylopoulos, J., Schmidt, J.W. (Eds.), On Conceptual Modelling, Springer-Verlag. pp. 191-233.

[55]

Ross, K.A., Modular stratification and magic sets for datalog programs with negation. Journal of the ACM. v41 i6. 1216-1266.

[56]

Staworko, S. and Chomicki, J., Consistent query answers in the presence of universal constraints. Information Systems. v35 i1. 1-22.

[57]

S. Staworko, J. Chomicki, J. Marcinkowski, Prioritized repairing and consistent query answering in relational databases, Annals of Mathematics and Artificial Intelligence, preprint arXiv:0908.0464v1, in press.

[58]

Wijsen, J., Condensed representation of database repairs for consistent query answering. In: Proceedings of the International Conference on Database Theory (ICDT'03), vol. 2572. Springer LNCS. pp. 378-393.

[59]

Wijsen, J., Database repairing using updates. ACM Transactions on Database Systems. v30 i3. 722-768.

[60]

Wijsen, J., On the consistent rewriting of conjunctive queries under primary key constraints. Information Systems. v34 i7. 578-601.

Cited By

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
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
Miao DZhang PLi JWang YCai Z(2022)Approximation and inapproximability results on computing optimal repairsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-022-00738-032:1(173-197)Online publication date: 12-Apr-2022
https://dl.acm.org/doi/10.1007/s00778-022-00738-0
Show More Cited By

Index Terms

The consistency extractor system: Answer set programs for consistent query answering in databases
1. Information systems
  1. Data management systems
    1. Database design and models
    2. Database management system engines
      1. Database query processing
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

Computing consistent query answers using conflict hypergraphs
CIKM '04: Proceedings of the thirteenth ACM international conference on Information and knowledge management

A consistent query answer in a possibly inconsistent database is an answer which is true in every (minimal) repair of the database. We present here a practical framework for computing consistent query answers for large, possibly inconsistent relational ...
Answer sets for consistent query answering in inconsistent databases

A relational database is inconsistent if it does not satisfy a given set of integrity constraints. Nevertheless, it is likely that most of the data in it is consistent with the constraints. In this paper we apply logic programming based on answer sets ...
The Consistency Extractor System: Querying Inconsistent Databases Using Answer Set Programs
SUM '07: Proceedings of the 1st international conference on Scalable Uncertainty Management

We present the Consistency Extractor System ( ConsEx ) that uses answer set programming to compute consistent answers to first-order queries posed to relational databases that may be inconsistent wrt their integrity constraints. Among other features,...

Comments

Information & Contributors

Information

Published In

cover image Data & Knowledge Engineering

Data & Knowledge Engineering Volume 69, Issue 6

June, 2010

128 pages

ISSN:0169-023X

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2010.

Publisher

Elsevier Science Publishers B. V.

Netherlands

Publication History

Published: 01 June 2010

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

25
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

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
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
Miao DZhang PLi JWang YCai Z(2022)Approximation and inapproximability results on computing optimal repairsThe VLDB Journal — The International Journal on Very Large Data Bases10.1007/s00778-022-00738-032:1(173-197)Online publication date: 12-Apr-2022
https://dl.acm.org/doi/10.1007/s00778-022-00738-0
Ahmetaj SDavid RPolleres AŠimkus M(2022)Repairing SHACL Constraint Violations Using Answer Set ProgrammingThe Semantic Web – ISWC 202210.1007/978-3-031-19433-7_22(375-391)Online publication date: 23-Oct-2022
https://dl.acm.org/doi/10.1007/978-3-031-19433-7_22
Koutris POuyang XWijsen JLibkin LPichler RGuagliardo P(2021)Consistent Query Answering for Primary Keys on Path QueriesProceedings of the 40th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems10.1145/3452021.3458334(215-232)Online publication date: 20-Jun-2021
https://dl.acm.org/doi/10.1145/3452021.3458334
Dixit AKolaitis PLi GLi ZIdreos SSrivastava D(2021)CAvSAT: Answering Aggregation Queries over Inconsistent Databases via SAT SolvingProceedings of the 2021 International Conference on Management of Data10.1145/3448016.3452749(2701-2705)Online publication date: 9-Jun-2021
https://dl.acm.org/doi/10.1145/3448016.3452749
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
Koutris PWijsen J(2021)Consistent Query Answering for Primary Keys in DatalogTheory of Computing Systems10.1007/s00224-020-09985-665:1(122-178)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1007/s00224-020-09985-6
Bertossi L(2021)Score-Based Explanations in Data Management and Machine Learning: An Answer-Set Programming Approach to Counterfactual AnalysisReasoning Web. Declarative Artificial Intelligence 10.1007/978-3-030-95481-9_7(145-184)Online publication date: 8-Sep-2021
https://dl.acm.org/doi/10.1007/978-3-030-95481-9_7
Miao DCai ZLi JGao XLiu X(2020)The computation of optimal subset repairsProceedings of the VLDB Endowment10.14778/3407790.340780913:12(2061-2074)Online publication date: 14-Sep-2020
https://dl.acm.org/doi/10.14778/3407790.3407809
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