Affiliation:
1. ILLC, University of Amsterdam
2. Leipzig University and ScaDS.AI
3. TU Dortmund University
Abstract
A fitting algorithm for conjunctive queries (CQs) is an algorithm that takes as input a collection of data examples and outputs a CQ that fits the examples. In this column, we propose a set of desirable properties of such algorithms and use this as a guide for surveying results from the authors' recent papers published in PODS 2023, IJCAI 2023, and Inf. Proc. Letters 2024. In particular, we explain and compare several concrete fitting algorithms, and we discuss complexity and size bounds for constructing fitting CQs with desirable properties.
Publisher
Association for Computing Machinery (ACM)
Subject
Information Systems,Software
Reference41 articles.
1. Characterizing schema mappings via data examples
2. B. Alexe, B. ten Cate, P. G. Kolaitis, and W.-C. Tan. Designing and refining schema mappings via data examples. In Proc. of SIGMOD, pages 133--144, 2011.
3. Queries and concept learning
4. Reverse Engineering SPARQL Queries
5. A new pac bound for intersection-closed concept classes;Auer P.;Machine Learning,2004