22 citations · 90 across the 29 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CC2022
No Efficient Disjunction or Conjunction of Switch-Lists
Stefan Mengel
It is shown that disjunction of two switch-lists can blow up the representation size exponentially. Since switch-lists can be negated without any increase in size, this shows that…
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…