research
∙
07/21/2023
A Fair and Memory/Time-efficient Hashmap
There is a large amount of work constructing hashmaps to minimize the nu...
share
research
∙
04/20/2022
JanusAQP: Efficient Partition Tree Maintenance for Dynamic Approximate Query Processing
Approximate query processing over dynamic databases, i.e., under inserti...
research
∙
05/05/2021
Dynamic Enumeration of Similarity Joins
This paper considers enumerating answers to similarity-join queries unde...
research
∙
03/29/2021
Combining Aggregation and Sampling (Nearly) Optimally for Approximate Query Processing
Sample-based approximate query processing (AQP) suffers from many pitfal...
research
∙
02/24/2021
Durable Top-K Instant-Stamped Temporal Records with User-Specified Scoring Functions
A way of finding interesting or exceptional records from instant-stamped...
research
∙
02/06/2021
The Maximum Exposure Problem
Given a set of points P and axis-aligned rectangles ℛ in the plane, a po...
research
∙
09/11/2019
Selecting Data to Clean for Fact Checking: Minimizing Uncertainty vs. Maximizing Surprise
We study the optimization problem of selecting numerical quantities to c...
research
∙
06/21/2019