23 citations · 149 across the 34 of their papers we have counts for
5 papers · 1 filter
A Unifying Perspective on Succinct Data Representations
Benny Kimelfeld, Wim Martens, Matthias Niewerth
Factorized representations (FRs) are a well-known tool to succinctly represent results of join queries and have been originally defined using the named database perspective. We def…
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…
Skyline Operators for Document Spanners
Antoine Amarilli, Benny Kimelfeld, Sébastien Labbé +1
When extracting a relation of spans (intervals) from a text document, a common practice is to filter out tuples of the relation that are deemed dominated by others. The domination…
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…
Spatial Voting with Incomplete Voter Information
Aviram Imber, Jonas Israel, Markus Brill +2
We consider spatial voting where candidates are located in the Euclidean -dimensional space, and each voter ranks candidates based on their distance from the voter's ideal point…