# A Nearly Instance-optimal Differentially Private Mechanism for Conjunctive Queries

arXiv: https://arxiv.org/abs/2105.05443 · HTML: https://mlsanity.com/paper/2105.05443/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 12 May 2021.

## Built on by (most cited first, 1 of 1)

- [General Gaussian Noise Mechanisms and Their Optimality for Unbiased Mean Estimation](https://mlsanity.com/paper/2301.13850/) (2023)

## Abstract (arXiv)

Releasing the result size of conjunctive queries and graph pattern queries under differential privacy (DP) has received considerable attention in the literature, but existing solutions do not offer any optimality guarantees. We provide the first DP mechanism for this problem with a fairly strong notion of optimality, which can be considered as a natural relaxation of instance-optimality to a constant.