Inan, AliGursoy, Mehmet EmreEsmerdag, EmirSaygin, Yucel2025-01-062025-01-062016978-1-4503-4215-510.1145/2949689.29496952-s2.0-84982157005https://doi.org/10.1145/2949689.2949695https://hdl.handle.net/20.500.14669/223528th International Conference on Scientific and Statistical Database Management (SSDBM) -- JUL 18-20, 2016 -- Budapest, HUNGARYDifferential privacy has gained attention from the community as the mechanism for privacy protection. Significant effort has focused on its application to data analysis, where statistical queries are submitted in batch and answers to these queries are perturbed with noise. The magnitude of this noise depends on the privacy parameter s and the sensitivity of the query set. However, computing the sensitivity is known to be NP-hard. In this study, we propose a method that approximates the sensitivity of a query set. Our solution builds a query-region-intersection graph. We prove that computing the maximum clique size of this graph is equivalent to bounding the sensitivity from above. Our bounds, to the best of our knowledge, are the tightest known in the literature. Our solution currently supports a limited but expressive subset of SQL queries (i.e., range queries), and almost all popular aggregate functions directly (except AVERAGE). Experimental results show the efficiency of our approach: even for large query sets (e.g., more than 2K queries over 5 attributes), by utilizing a state-of-the-art solution for the maximum clique problem, we can approximate sensitivity in under a minute.eninfo:eu-repo/semantics/closedAccessDifferential privacymaximum clique problemstatistical database securitySQLrange queriesConference Object0WOS:000694698100003N/A