6 citations · 7 across the 5 of their papers we have counts for
Showing cs.DBShow all
2 papers · 1 filter
cs.DB2026
Let's Play Tag: Linear Time Evaluation of Conjunctive Queries under TGD Constraints
Nofar Carmeli, Carsten Lutz, Marcin Przybyłko
We study the limits of linear time evaluation of conjunctive queries under constraints expressed as tuple-generating dependencies (TGDs), across several modes of query evaluation:…
cs.DB2023★ 1 cited
Extremal Fitting CQs do not Generalize
Balder ten Cate, Maurice Funk, Jean Christoph Jung +1
A fitting algorithm for conjunctive queries (CQs) produces, given a set of positively and negatively labeled data examples, a CQ that fits these examples. In general, there may be…