6 citations · 10 across the 10 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DB2023★ 6 cited
Efficient Computation of Quantiles over Joins
Nikolaos Tziavelis, Nofar Carmeli, Wolfgang Gatterbauer +2
We present efficient algorithms for Quantile Join Queries, abbreviated as %JQ. A %JQ asks for the answer at a specified relative position (e.g., 50% for the median) under some orde…
cs.DB2023★ 1 cited
Direct Access for Answers to Conjunctive Queries with Aggregation
Idan Eldar, Nofar Carmeli, Benny Kimelfeld
We study the fine-grained complexity of conjunctive queries with grouping and aggregation. For common aggregate functions (e.g., min, max, count, sum), such a query can be phrased…