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.

翻译：区分隐私(DP)下的合并质询和图表式质询的结果规模在文献中受到相当重视,但现有解决方案并不能提供任何最佳性保障。 我们为这一问题的第一个DP机制提供了相当强烈的优化性概念,这可以被视为将例优性自然降为常数。