103 citations · 120 across the 18 of their papers we have counts for
Showing 2022 · cs.DBShow all
2 papers · 2 filters
cs.DB2022
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries
Antoine Amarilli
We study the uniform query reliability problem, which asks, for a fixed Boolean query Q, given an instance I, how many subinstances of I satisfy Q. Equivalently, this is a restrict…
cs.DB2022★ 2 cited
Worst-case Analysis for Interactive Evaluation of Boolean Provenance
Antoine Amarilli, Yael Amsterdamer
In recent work, we have introduced a framework for fine-grained consent management in databases, which combines Boolean data provenance with the field of interactive Boolean evalua…