{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T20:13:13Z","timestamp":1767903193345,"version":"3.49.0"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T00:00:00Z","timestamp":1698624000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGMOD Rec."],"published-print":{"date-parts":[[2023,10,30]]},"abstract":"<jats:p>Differential privacy has garnered significant attention in recent years due to its potential in offering robust privacy protection for individual data during analysis. With the increasing volume of sensitive information being collected by organizations and analyzed through SQL queries, the development of a general-purpose query engine that is capable of supporting a broad range of queries while maintaining differential privacy has become the holy grail in privacypreserving query release. Towards this goal, this article surveys recent advances in query evaluation under differential privacy.<\/jats:p>","DOI":"10.1145\/3631504.3631506","type":"journal-article","created":{"date-parts":[[2023,11,2]],"date-time":"2023-11-02T14:48:51Z","timestamp":1698936531000},"page":"6-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Query Evaluation under Differential Privacy"],"prefix":"10.1145","volume":"52","author":[{"given":"Wei","family":"Dong","sequence":"first","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong"}]},{"given":"Ke","family":"Yi","sequence":"additional","affiliation":[{"name":"Hong Kong University of Science and Technology, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2023,11,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978318"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/551350"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196959.3196960"},{"key":"e_1_2_1_4_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2902251.2902280","volume-title":"Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","author":"Abo Khamis M.","year":"2016","unstructured":"M. Abo Khamis , H. Q. Ngo , and A. Rudra . Faq: questions asked frequently . In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems , pages 13 -- 28 , 2016 . M. Abo Khamis, H. Q. Ngo, and A. Rudra. Faq: questions asked frequently. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 13--28, 2016."},{"key":"e_1_2_1_5_1","first-page":"263","volume-title":"International Conference on Machine Learning","author":"Amin K.","year":"2019","unstructured":"K. Amin , A. Kulesza , A. Munoz , and S. Vassilvtiskii . Bounding user contributions: A bias-variance trade-off in differential privacy . In International Conference on Machine Learning , pages 263 -- 271 . PMLR, 2019 . K. Amin, A. Kulesza, A. Munoz, and S. Vassilvtiskii. Bounding user contributions: A bias-variance trade-off in differential privacy. In International Conference on Machine Learning, pages 263--271. PMLR, 2019."},{"key":"e_1_2_1_6_1","volume-title":"Differentially private learning with adaptive clipping. arXiv preprint arXiv:1905.03871","author":"Andrew G.","year":"2019","unstructured":"G. Andrew , O. Thakkar , H. B. McMahan , and S. Ramaswamy . Differentially private learning with adaptive clipping. arXiv preprint arXiv:1905.03871 , 2019 . G. Andrew, O. Thakkar, H. B. McMahan, and S. Ramaswamy. Differentially private learning with adaptive clipping. arXiv preprint arXiv:1905.03871, 2019."},{"key":"e_1_2_1_7_1","volume-title":"International Colloquium on Automata, Languages, and Programming (ICALP)","author":"Arapinis M.","year":"2016","unstructured":"M. Arapinis , D. Figueira , and M. Gaboardi . Sensitivity of counting queries . In International Colloquium on Automata, Languages, and Programming (ICALP) , 2016 . M. Arapinis, D. Figueira, and M. Gaboardi. Sensitivity of counting queries. In International Colloquium on Automata, Languages, and Programming (ICALP), 2016."},{"key":"e_1_2_1_8_1","volume-title":"Instance-optimality in differential privacy via approximate inverse sensitivity mechanisms. Advances in neural information processing systems, 33","author":"Asi H.","year":"2020","unstructured":"H. Asi and J. C. Duchi . Instance-optimality in differential privacy via approximate inverse sensitivity mechanisms. Advances in neural information processing systems, 33 , 2020 . H. Asi and J. C. Duchi. Instance-optimality in differential privacy via approximate inverse sensitivity mechanisms. Advances in neural information processing systems, 33, 2020."},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the VLDB Endowment, 6(14)","author":"Bakibayev N.","year":"2013","unstructured":"N. Bakibayev , T. Kocisk'y , D. Olteanu , and J. Z\u00b4avodn'y . Aggregation and ordering in factorised databases . Proceedings of the VLDB Endowment, 6(14) , 2013 . N. Bakibayev, T. Kocisk'y, D. Olteanu, and J. Z\u00b4avodn'y. Aggregation and ordering in factorised databases. Proceedings of the VLDB Endowment, 6(14), 2013."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422449"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53641-4_24"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3589287"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043621.2043626"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465304"},{"issue":"8","key":"e_1_2_1_15_1","doi-asserted-by":"crossref","first-page":"e2218605120","DOI":"10.1073\/pnas.2218605120","article-title":"Confidence-ranked reconstruction of census microdata from published statistics","volume":"120","author":"Dick T.","year":"2023","unstructured":"T. Dick , C. Dwork , M. Kearns , T. Liu , A. Roth , G. Vietri , and Z. S. Wu . Confidence-ranked reconstruction of census microdata from published statistics . Proceedings of the National Academy of Sciences , 120 ( 8 ): e2218605120 , 2023 . T. Dick, C. Dwork, M. Kearns, T. Liu, A. Roth, G. Vietri, and Z. S. Wu. Confidence-ranked reconstruction of census microdata from published statistics. Proceedings of the National Academy of Sciences, 120(8):e2218605120, 2023.","journal-title":"Proceedings of the National Academy of Sciences"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517844"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","first-page":"2190","DOI":"10.1109\/SP46215.2023.10179466","volume-title":"2023 IEEE Symposium on Security and Privacy (SP)","author":"Dong W.","year":"2023","unstructured":"W. Dong , Q. Luo , and K. Yi . Continual observation under user-level differential privacy . In 2023 IEEE Symposium on Security and Privacy (SP) , pages 2190 -- 2207 . IEEE Computer Society , 2023 . W. Dong, Q. Luo, and K. Yi. Continual observation under user-level differential privacy. In 2023 IEEE Symposium on Security and Privacy (SP), pages 2190--2207. IEEE Computer Society, 2023."},{"key":"e_1_2_1_18_1","volume-title":"Proc. ACM SIGMOD International Conference on Management of Data","author":"Dong W.","year":"2023","unstructured":"W. Dong , D. Sun , and K. Yi . Better than composition: How to answer multiple relational queries under differential privacy . In Proc. ACM SIGMOD International Conference on Management of Data , 2023 . W. Dong, D. Sun, and K. Yi. Better than composition: How to answer multiple relational queries under differential privacy. In Proc. ACM SIGMOD International Conference on Management of Data, 2023."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3448016.3452813"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3517804.3524143"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3584372.3588669"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806787"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536467"},{"key":"e_1_2_1_24_1","volume-title":"The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9(3--4):211--407","author":"Dwork C.","year":"2014","unstructured":"C. Dwork and A. Roth . The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9(3--4):211--407 , 2014 . C. Dwork and A. Roth. The algorithmic foundations of differential privacy. Foundations and Trends\u00ae in Theoretical Computer Science, 9(3--4):211--407, 2014."},{"key":"e_1_2_1_25_1","volume-title":"Shifted inverse: A general mechanism for monotonic functions under user differential privacy","author":"Fang J.","year":"2022","unstructured":"J. Fang , W. Dong , and K. Yi . Shifted inverse: A general mechanism for monotonic functions under user differential privacy . 2022 . J. Fang, W. Dong, and K. Yi. Shifted inverse: A general mechanism for monotonic functions under user differential privacy. 2022."},{"key":"e_1_2_1_26_1","volume-title":"Advances in Neural Information Processing Systems","author":"Huang Z.","year":"2021","unstructured":"Z. Huang , Y. Liang , and K. Yi . Instance-optimal mean estimation under differential privacy . Advances in Neural Information Processing Systems , 2021 . Z. Huang, Y. Liang, and K. Yi. Instance-optimal mean estimation under differential privacy. Advances in Neural Information Processing Systems, 2021."},{"key":"e_1_2_1_27_1","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1145\/2902251.2902293","volume-title":"Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","author":"Joglekar M. R.","year":"2016","unstructured":"M. R. Joglekar , R. Puttagunta , and C. R\u00b4e . Ajar: Aggregations and joins over annotated relations . In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems , pages 91 -- 106 , 2016 . M. R. Joglekar, R. Puttagunta, and C. R\u00b4e. Ajar: Aggregations and joins over annotated relations. In Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pages 91--106, 2016."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3187009.3177733"},{"key":"e_1_2_1_29_1","first-page":"1853","volume-title":"Proceedings of the 32nd Annual Conference on Learning Theory, COLT '19","author":"Kamath G.","year":"2019","unstructured":"G. Kamath , J. Li , V. Singhal , and J. Ullman . Privately learning high-dimensional distributions . In Proceedings of the 32nd Annual Conference on Learning Theory, COLT '19 , pages 1853 -- 1902 , 2019 . G. Kamath, J. Li, V. Singhal, and J. Ullman. Privately learning high-dimensional distributions. In Proceedings of the 32nd Annual Conference on Learning Theory, COLT '19, pages 1853--1902, 2019."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402749"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_26"},{"key":"e_1_2_1_32_1","volume-title":"Learning models over relational data using sparse tensors and functional dependencies. ACM Transactions on Database Systems (TODS), 45(2):1--66","author":"Khamis M. A.","year":"2020","unstructured":"M. A. Khamis , H. Q. Ngo , X. Nguyen , D. Olteanu , and M. Schleich . Learning models over relational data using sparse tensors and functional dependencies. ACM Transactions on Database Systems (TODS), 45(2):1--66 , 2020 . M. A. Khamis, H. Q. Ngo, X. Nguyen, D. Olteanu, and M. Schleich. Learning models over relational data using sparse tensors and functional dependencies. ACM Transactions on Database Systems (TODS), 45(2):1--66, 2020."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989345"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342274"},{"key":"e_1_2_1_35_1","doi-asserted-by":"crossref","first-page":"1717","DOI":"10.1145\/3035918.3054775","volume-title":"Proceedings of the 2017 ACM International Conference on Management of Data","author":"Kumar A.","year":"2017","unstructured":"A. Kumar , M. Boehm , and J. Yang . Data management in machine learning: Challenges, techniques, and systems . In Proceedings of the 2017 ACM International Conference on Management of Data , pages 1717 -- 1722 , 2017 . A. Kumar, M. Boehm, and J. Yang. Data management in machine learning: Challenges, techniques, and systems. In Proceedings of the 2017 ACM International Conference on Management of Data, pages 1717--1722, 2017."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559850"},{"key":"e_1_2_1_37_1","first-page":"149","volume-title":"USENIX Symposium on Operating Systems Design and Implementation","author":"Narayan A.","year":"2012","unstructured":"A. Narayan and A. Haeberlen . Djoin: Differentially private join queries over distributed databases . In USENIX Symposium on Operating Systems Design and Implementation , pages 149 -- 162 , 2012 . A. Narayan and A. Haeberlen. Djoin: Differentially private join queries over distributed databases. In USENIX Symposium on Operating Systems Design and Implementation, pages 149--162, 2012."},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3384702"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250803"},{"key":"e_1_2_1_40_1","volume-title":"Size bounds for factorised representations of query results. ACM Transactions on Database Systems (TODS), 40(1):1--44","author":"Olteanu D.","year":"2015","unstructured":"D. Olteanu and J. Z\u00b4avodn'y . Size bounds for factorised representations of query results. ACM Transactions on Database Systems (TODS), 40(1):1--44 , 2015 . D. Olteanu and J. Z\u00b4avodn'y. Size bounds for factorised representations of query results. ACM Transactions on Database Systems (TODS), 40(1):1--44, 2015."},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.4204\/EPTCS.85.7"},{"key":"e_1_2_1_42_1","volume-title":"Proceedings of the VLDB Endowment, 7(8)","author":"Proserpio D.","year":"2014","unstructured":"D. Proserpio , S. Goldberg , and F. McSherry . Calibrating data to sensitivity in private data analysis . Proceedings of the VLDB Endowment, 7(8) , 2014 . D. Proserpio, S. Goldberg, and F. McSherry. Calibrating data to sensitivity in private data analysis. Proceedings of the VLDB Endowment, 7(8), 2014."},{"key":"e_1_2_1_43_1","first-page":"1","article-title":"General data protection regulation","volume":"25","author":"Regulation P.","year":"2018","unstructured":"P. Regulation . General data protection regulation . Intouch , 25 : 1 -- 5 , 2018 . P. Regulation. General data protection regulation. Intouch, 25:1--5, 2018.","journal-title":"Intouch"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882939"},{"key":"e_1_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389762"},{"key":"e_1_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-57048-8_7"},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2737785"}],"container-title":["ACM SIGMOD Record"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3631504.3631506","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3631504.3631506","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:52Z","timestamp":1750291432000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3631504.3631506"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,30]]},"references-count":47,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,10,30]]}},"alternative-id":["10.1145\/3631504.3631506"],"URL":"https:\/\/doi.org\/10.1145\/3631504.3631506","relation":{},"ISSN":["0163-5808"],"issn-type":[{"value":"0163-5808","type":"print"}],"subject":[],"published":{"date-parts":[[2023,10,30]]},"assertion":[{"value":"2023-11-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}