3 citations · 4 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.DB2022★ 3 cited
Efficiently Enumerating Answers to Ontology-Mediated Queries
Carsten Lutz, Marcin Przybyłko
We study the enumeration of answers to ontology-mediated queries (OMQs) where the ontology is a set of guarded TGDs or formulated in the description logic ELI and the query is a co…