6 citations · 10 across the 10 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
cs.DB2022
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
Karl Bringmann, Nofar Carmeli
We study the enumeration of answers to Unions of Conjunctive Queries (UCQs) with optimal time guarantees. More precisely, we wish to identify the queries that can be solved with li…
cs.DB2022★ 2 cited
Conjunctive Queries With Self-Joins, Towards a Fine-Grained Complexity Analysis
Nofar Carmeli, Luc Segoufin
Even though query evaluation is a fundamental task in databases, known classifications of conjunctive queries by their fine-grained complexity only apply to queries without self-jo…
cs.DB2022
Tight Fine-Grained Bounds for Direct Access on Join Queries
Karl Bringmann, Nofar Carmeli, Stefan Mengel
We consider the task of lexicographic direct access to query answers. That is, we want to simulate an array containing the answers of a join query sorted in a lexicographic order c…