DP-S4S: Accurate and Scalable Select-Join-Aggregate Query Processing with User-Level Differential Privacy
Yuan Qiu, Xiaokui Xiao, Yin Yang
Abstract
Answering Select-Join-Aggregate (SJA) queries with differential privacy (DP) is a fundamental problem with important applications in various domains. The current state-of-the-art methods ensure user-level DP (i.e., the adversary cannot infer the presence or absence of any given individual user with high confidence) and achieve instance-optimal accuracy on the query results. However, these solutions involve solving expensive optimization programs, which may incur prohibitive computational overhead for large databases.
One promising direction to achieve scalability is through sampling, which provides a tunable trade-off between result utility and computational costs. However, applying sampling to differentially private SJA processing is a challenge for two reasons. First, it is unclear what to sample , in order to achieve the best accuracy within a given computational budget. Second, prior solutions were not designed with sampling in mind, and their mathematical tool chains are not sampling-friendly. To our knowledge, the only known solution that applies sampling to private SJA processing is S&E, a recent proposal that (i) samples users and (ii) combines sampling directly with existing solutions to enforce DP. We show that both are suboptimal designs; consequently, even with a relatively high sample rate, the error incurred by S&E can be 10x higher than the underlying DP mechanism without sampling.
Motivated by this, we propose Differentially Private Sampling for Scale (DP-S4S), a novel mechanism that addresses the above challenges by (i) sampling aggregation units instead of users, and (ii) laying the mathematical foundation for SJA processing under Rényi-DP , which composes more easily with sampling. Further, DP-S4S can answer both scalar (e.g., COUNT, SUM, etc.) and vector (with GROUP BY predicts) SJA queries. Extensive experiments on real data demonstrate that DP-S4S enables scalable SJA processing on large datasets under user-level DP, while maintaining high result utility.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on8
- R2T: Instance-optimal Truncation for Differentially Private Query Evaluation with Foreign KeysWei Dong, Juanru Fang, Ke Yi, Yuchao Tao et al.SIGMOD 2022 · 41 citations
- User-Level Differential Privacy With Few Examples Per UserBadih Ghazi, Pritish Kamath, Ravi Kumar, Pasin Manurangsi et al.NeurIPS 2023 · 19 citations
- Better than Composition: How to Answer Multiple Relational Queries under Differential PrivacyWei Dong, Dajun Sun, Ke YiSIGMOD 2023 · 16 citations
- DProvDB: Differentially Private Query Processing with Multi-Analyst ProvenanceShufan Zhang, Xi HeSIGMOD 2024 · 10 citations
- Continual Observation of Joins under Differential PrivacyWei Dong, Zijun Chen, Qiyao Luo, Elaine Shi et al.SIGMOD 2024 · 9 citations
Related papers
- SAQE: Practical Privacy-Preserving Approximate Query Processing for Data FederationsJohes Bater, Yongjoo Park, Xi He, Xiao Wang et al.VLDB 2020
- Privacy Amplification by Sampling under User-level Differential PrivacyJuanru Fang, Ke YiSIGMOD 2024 · 4 citations
- Budget Sharing for Multi-Analyst Differential PrivacyDavid Pujol, Yikai Wu, Brandon Fain, Ashwin MachanavajjhalaVLDB 2021 · 7 citations
- DPXPlain: Privately Explaining Aggregate Query AnswersYuchao Tao, Amir Gilad, Ashwin Machanavajjhala, Sudeepa RoyVLDB 2023 · 15 citations
- DP-starJ: A Differential Private Scheme towards Analytical Star-Join QueriesCongcong Fu, Hui Li, Jian Lou, Huizhen Li et al.SIGMOD 2024 · 2 citations
