Document Open Access Logo

Query Repairs

Authors Balder ten Cate , Phokion G. Kolaitis , Carsten Lutz

PDF
Thumbnail PDF

File

LIPIcs.ICDT.2025.15.pdf
  • Filesize: 0.77 MB
  • 19 pages

Document Identifiers

Author Details

Balder ten Cate
  • University of Amsterdam, The Netherlands
Phokion G. Kolaitis
  • University of California Santa Cruz, CA, USA
  • IBM Research - Almaden, San Jose, CA, USA
Carsten Lutz
  • Leipzig University, Germany
  • Center for Scalable Data Analytics and Artifcial Intelligence (ScaDS.AI), Dresden/Leipzig, Germany

Funding

  • ten Cate, Balder: Supported by EU Horizon 2020 Grant MSCA-101031081.
  • Kolaitis, Phokion G.: Partially supported by NSF Grant IIS-1814152.
  • Lutz, Carsten: Supported by the DFG Collaborative Research Center 1320 EASE.

Cite As Get BibTex

Balder ten Cate, Phokion G. Kolaitis, and Carsten Lutz. Query Repairs. In 28th International Conference on Database Theory (ICDT 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 328, pp. 15:1-15:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.ICDT.2025.15

Abstract

We formalize and study the problem of repairing database queries based on user feedback in the form of a collection of labeled examples. We propose a framework based on the notion of a proximity pre-order, and we investigate and compare query repairs for conjunctive queries (CQs) using different such pre-orders. The proximity pre-orders we consider are based on query containment and on distance metrics for CQs.

Subject Classification

ACM Subject Classification
  • Information systems → Query languages
Keywords
  • Query Repairs
  • Databases
  • Conjunctive Queries
  • Data Examples
  • Fitting

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Bogdan Alexe, Balder ten Cate, Phokion G. Kolaitis, and Wang-Chiew Tan. Designing and refining schema mappings via data examples. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, SIGMOD '11, pages 133-144, New York, NY, USA, 2011. Association for Computing Machinery. URL: https://doi.org/10.1145/1989323.1989338.
  2. Marcelo Arenas, Leopoldo E. Bertossi, and Jan Chomicki. Consistent query answers in inconsistent databases. In Victor Vianu and Christos H. Papadimitriou, editors, Proceedings of the Eighteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 31 - June 2, 1999, Philadelphia, Pennsylvania, USA, pages 68-79. ACM Press, 1999. URL: https://doi.org/10.1145/303976.303983.
  3. Pablo Barceló, Leonid Libkin, and Miguel Romero. Efficient approximations of conjunctive queries. SIAM J. Comput., 43(3):1085-1130, 2014. URL: https://doi.org/10.1137/130911731.
  4. Pablo Barceló, Mikaël Romero, and Thomas Zeume. A more general theory of static approximations for conjunctive queries. Theory of Computing Systems, 64(4):916-964, 2020. URL: https://doi.org/10.1007/s00224-019-09924-0.
  5. Leopoldo E. Bertossi. Database Repairing and Consistent Query Answering. Synthesis Lectures on Data Management. Morgan & Claypool Publishers, 2011. URL: https://doi.org/10.2200/S00379ED1V01Y201108DTM020.
  6. Meghyn Bienvenu and Riccardo Rosati. Tractable approximations of consistent query answering for robust ontology-based data access. In Francesca Rossi, editor, IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013, pages 775-781. IJCAI/AAAI, 2013. URL: http://www.aaai.org/ocs/index.php/IJCAI/IJCAI13/paper/view/6904.
  7. Ilaria Bordino, Carlos Castillo, Debora Donato, and Aristides Gionis. Query similarity by projecting the query-flow graph. In Fabio Crestani, Stéphane Marchand-Maillet, Hsin-Hsi Chen, Efthimis N. Efthimiadis, and Jacques Savoy, editors, Proceeding of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 2010, Geneva, Switzerland, July 19-23, 2010, pages 515-522. ACM, 2010. URL: https://doi.org/10.1145/1835449.1835536.
  8. Balder ten Cate and Víctor Dalmau. The product homomorphism problem and applications. In Marcelo Arenas and Martín Ugarte, editors, 18th International Conference on Database Theory, ICDT 2015, March 23-27, 2015, Brussels, Belgium, volume 31 of LIPIcs, pages 161-176. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2015. URL: https://doi.org/10.4230/LIPIcs.ICDT.2015.161.
  9. Balder ten Cate, Victor Dalmau, Maurice Funk, and Carsten Lutz. Extremal fitting problems for conjunctive queries. In Proceedings of PODS 2023, 2023. Google Scholar
  10. Kevin Chen-Chuan Chang and Hector Garcia-Molina. Approximate query mapping: Accounting for translation closeness. VLDB J., 10(2-3):155-181, 2001. URL: https://doi.org/10.1007/S007780100042.
  11. Surajit Chaudhuri. Finding nonrecursive envelopes for datalog predicates. In Catriel Beeri, editor, Proceedings of the Twelfth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 25-28, 1993, Washington, DC, USA, pages 135-146. ACM Press, 1993. URL: https://doi.org/10.1145/153850.153862.
  12. Surajit Chaudhuri and Phokion G. Kolaitis. Can datalog be approximated? J. Comput. Syst. Sci., 55(2):355-369, 1997. URL: https://doi.org/10.1006/JCSS.1997.1528.
  13. Mukesh Dalal. Investigations into a theory of knowledge base revision: preliminary report. In Proceedings of the Seventh AAAI National Conference on Artificial Intelligence, AAAI'88, pages 475-479. AAAI Press, 1988. Google Scholar
  14. Oliver M. Duschka and Michael R. Genesereth. Answering recursive queries using views. In Alberto O. Mendelzon and Z. Meral Özsoyoglu, editors, Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, May 12-14, 1997, Tucson, Arizona, USA, pages 109-116. ACM Press, 1997. URL: https://doi.org/10.1145/263661.263674.
  15. Kenneth D. Forbus. Introducing actions into qualitative simulation. In Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI-89), pages 1273-1278, Detroit, MI, August 1989. Morgan Kaufmann. URL: http://ijcai.org/Proceedings/89-2/Papers/068.pdf.
  16. Anneke Haga, Carsten Lutz, Leif Sabellek, and Frank Wolter. How to approximate ontology-mediated queries. In Proc. of KR, pages 323-333, 2021. URL: https://doi.org/10.24963/KR.2021/31.
  17. Witold Lipski Jr. On semantic issues connected with incomplete information databases. ACM Trans. Database Syst., 4(3):262-296, 1979. URL: https://doi.org/10.1145/320083.320088.
  18. Verena Kantere, George Orfanoudakis, Anastasios Kementsietsidis, and Timos K. Sellis. Query relaxation across heterogeneous data sources. In James Bailey, Alistair Moffat, Charu C. Aggarwal, Maarten de Rijke, Ravi Kumar, Vanessa Murdock, Timos K. Sellis, and Jeffrey Xu Yu, editors, Proceedings of the 24th ACM International Conference on Information and Knowledge Management, CIKM 2015, Melbourne, VIC, Australia, October 19 - 23, 2015, pages 473-482. ACM, 2015. URL: https://doi.org/10.1145/2806416.2806529.
  19. Benny Kimelfeld, Ester Livshits, and Liat Peterfreund. Counting and enumerating preferred database repairs. Theoretical Computer Science, 837:115-157, 2020. URL: https://doi.org/10.1016/j.tcs.2020.05.016.
  20. Gábor Kun. Constraints, MMSNP and expander relational structures. Combinatorica, 33(3):335-347, 2013. URL: https://doi.org/10.1007/S00493-013-2405-4.
  21. Claire Le Goues, Michael Pradel, and Abhik Roychoudhury. Automated program repair. Commun. ACM, 62(12):56-65, November 2019. URL: https://doi.org/10.1145/3318162.
  22. Leonid Libkin. Models of approximation in databases. Theor. Comput. Sci., 190(2):167-210, 1998. URL: https://doi.org/10.1016/S0304-3975(97)00090-X.
  23. Ion Muslea and Thomas J. Lee. Online query relaxation via bayesian causal structures discovery. In Manuela M. Veloso and Subbarao Kambhampati, editors, Proceedings, The Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, July 9-13, 2005, Pittsburgh, Pennsylvania, USA, pages 831-836. AAAI Press / The MIT Press, 2005. URL: http://www.aaai.org/Library/AAAI/2005/aaai05-131.php.
  24. K. Satoh. Nonmonotonic reasoning by minimal belief revision. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88), pages 455-462, 1988. Google Scholar
  25. Balder ten Cate, Maurice Funk, Jean Christoph Jung, and Carsten Lutz. Fitting algorithms for conjunctive queries. SIGMOD Record, 52, 2023. URL: https://doi.org/10.1145/3641832.3641834.
  26. Balder ten Cate, Maurice Funk, Jean Christoph Jung, and Carsten Lutz. Sat-based pac learning of description logic concepts. In Edith Elkind, editor, Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, IJCAI-23, pages 3347-3355. International Joint Conferences on Artificial Intelligence Organization, August 2023. Main Track. URL: https://doi.org/10.24963/ijcai.2023/373.
  27. Balder ten Cate, Phokion Kolaitis, and Carsten Lutz. Query repairs, 2025. URL: https://arxiv.org/abs/2501.11162.
  28. Ross Willard. Testing expressibility is hard. In David Cohen, editor, Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6-10, 2010. Proceedings, volume 6308 of Lecture Notes in Computer Science, pages 9-23. Springer, 2010. URL: https://doi.org/10.1007/978-3-642-15396-9_4.
  29. Marianne Winslett. Updating Logical Databases. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact