research
∙
05/25/2023
Efficient Computation of Quantiles over Joins
We present efficient algorithms for Quantile Join Queries, abbreviated a...
share
research
∙
03/09/2023
Direct Access for Answers to Conjunctive Queries with Aggregation
We study the fine-grained complexity of conjunctive queries with groupin...
research
∙
10/21/2022
Unbalanced Triangle Detection and Enumeration Hardness for Unions of Conjunctive Queries
We study the enumeration of answers to Unions of Conjunctive Queries (UC...
research
∙
06/10/2022
Conjunctive queries with self-joins, towards a fine-grained complexity analysis
The complexity of evaluating conjunctive queries without self-joins is w...
research
∙
01/07/2022
Tight Fine-Grained Bounds for Direct Access on Join Queries
We consider the task of lexicographic direct access to query answers. Th...
research
∙
12/22/2020
Tractable Orders for Direct Access to Ranked Answers of Conjunctive Queries
We study the question of when we can provide logarithmic-time direct acc...
research
∙
09/29/2020
Database Repairing with Soft Functional Dependencies
A common interpretation of soft constraints penalizes the database for e...
research
∙
08/21/2020
Tuple-Independent Representations of Infinite Probabilistic Databases
Probabilistic databases (PDBs) are probability spaces over database inst...
research
∙
05/29/2020
ExplainIt: Explainable Review Summarization with Opinion Causality Graphs
We present ExplainIt, a review summarization system centered around opin...
research
∙
12/23/2019
Answering (Unions of) Conjunctive Queries using Random Access and Random-Order Enumeration
As data analytics becomes more crucial to digital systems, so grows the ...
research
∙
12/10/2018
On the Enumeration Complexity of Unions of Conjunctive Queries
We study the enumeration complexity of Unions of Conjunctive Queries (UC...
research
∙
12/10/2018
Enumeration Complexity of Unions of Conjunctive Queries
We study the enumeration complexity of answering unions of conjunctive q...
research
∙
12/21/2017
