Fitting Algorithms for Conjunctive Queries
| Authors |
|
|---|---|
| Publication date | 12-2023 |
| Journal | SIGMOD Record |
| Volume | Issue number | 52 | 4 |
| Pages (from-to) | 6-18 |
| Number of pages | 13 |
| Organisations |
|
| 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. |
| Document type | Article |
| Language | English |
| Published at | https://doi.org/10.1145/3641832.3641834 |
| Downloads |
3641832.3641834
(Final published version)
|
| Permalink to this page | |
