{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T07:29:25Z","timestamp":1770535765994,"version":"3.49.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:p>\n            We consider the problem of privately releasing a class of queries that we call\n            <jats:italic>hierarchical count-of-counts histograms<\/jats:italic>\n            . Count-of-counts histograms partition the rows of an input table into groups (e.g., group of people in the same household), and for every integer\n            <jats:italic>j<\/jats:italic>\n            report the number of groups of size\n            <jats:italic>j<\/jats:italic>\n            . Hierarchical count-of-counts queries report count-of-counts histograms at different granularities as per hierarchy defined on an attribute in the input data (e.g., geographical location of a household at the national, state and county levels). In this paper, we introduce this problem, along with appropriate error metrics and propose a differentially private solution that generates count-of-counts histograms that are consistent across all levels of the hierarchy.\n          <\/jats:p>","DOI":"10.14778\/3236187.3236202","type":"journal-article","created":{"date-parts":[[2018,9,10]],"date-time":"2018-09-10T12:12:28Z","timestamp":1536581548000},"page":"1509-1521","source":"Crossref","is-referenced-by-count":17,"title":["Differentially private hierarchical count-of-counts histograms"],"prefix":"10.14778","volume":"11","author":[{"given":"Yu-Hsuan","family":"Kuo","sequence":"first","affiliation":[{"name":"Penn State University"}]},{"given":"Cho-Chun","family":"Chiu","sequence":"additional","affiliation":[{"name":"Penn State University"}]},{"given":"Daniel","family":"Kifer","sequence":"additional","affiliation":[{"name":"Penn State University and U.S. Census Bureau"}]},{"given":"Michael","family":"Hay","sequence":"additional","affiliation":[{"name":"Colgate University"}]},{"given":"Ashwin","family":"Machanavajjhala","sequence":"additional","affiliation":[{"name":"Duke University"}]}],"member":"320","published-online":{"date-parts":[[2018,7]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"New york city open data. https:\/\/opendata.cityofnewyork.us\/.  New york city open data. https:\/\/opendata.cityofnewyork.us\/."},{"key":"e_1_2_1_2_1","unstructured":"New york city taxi data. http:\/\/www.nyc.gov\/html\/tlc\/html\/about\/trip_record_data.shtml.  New york city taxi data. http:\/\/www.nyc.gov\/html\/tlc\/html\/about\/trip_record_data.shtml."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.80"},{"key":"e_1_2_1_4_1","volume-title":"Statistical inference under order restrictions","author":"Barlow R.","year":"1972","unstructured":"R. Barlow , D. Bartholomew , J. Bremner , and H. Brunk . Statistical inference under order restrictions . 1972 . R. Barlow, D. Bartholomew, J. Bremner, and H. Brunk. Statistical inference under order restrictions. 1972."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1972.10481216"},{"key":"e_1_2_1_6_1","first-page":"153","volume-title":"Differentially Private Password Frequency Lists. In NDSS '16: The 2016 Network and Distributed System Security Symposium","author":"Blocki J.","year":"2016","unstructured":"J. Blocki , A. Datta , and J. Bonneau . Differentially Private Password Frequency Lists. In NDSS '16: The 2016 Network and Distributed System Security Symposium , page 153 , February 2016 . J. Blocki, A. Datta, and J. Bonneau. Differentially Private Password Frequency Lists. In NDSS '16: The 2016 Network and Distributed System Security Symposium, page 153, February 2016."},{"key":"e_1_2_1_7_1","volume-title":"2010 census summary file 1","author":"U. C. Bureau","year":"2010","unstructured":"U. C. Bureau . 2010 census summary file 1 , 2010 census of population and housing, technical documentation. https: \/\/www.census.gov\/prod\/cen2010\/doc\/sf1.pdf, 2012. U. C. Bureau. 2010 census summary file 1, 2010 census of population and housing, technical documentation. https: \/\/www.census.gov\/prod\/cen2010\/doc\/sf1.pdf, 2012."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807085.1807104"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021036"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.16"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989347"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11681878_14"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536464"},{"key":"e_1_2_1_14_1","volume-title":"Gurobi optimizer reference manual","author":"Gurobi Optimization I.","year":"2016","unstructured":"I. Gurobi Optimization . Gurobi optimizer reference manual , 2016 . I. Gurobi Optimization. Gurobi optimizer reference manual, 2016."},{"key":"e_1_2_1_15_1","first-page":"2339","volume-title":"NIPS","author":"Hardt M.","year":"2012","unstructured":"M. Hardt , K. Ligett , and F. McSherry . A simple and practical algorithm for differentially private data release . In NIPS , pages 2339 -- 2347 , 2012 . M. Hardt, K. Ligett, and F. McSherry. A simple and practical algorithm for differentially private data release. In NIPS, pages 2339--2347, 2012."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.14778\/1920841.1920970"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1358"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3035945"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.14778\/2732269.2732271"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463721"},{"key":"e_1_2_1_21_1","volume-title":"Matching Theory","author":"Lovasz L.","year":"1986","unstructured":"L. Lovasz and M. D. Plummer . Matching Theory . AMS Chelsea Publishing , 1986 . L. Lovasz and M. D. Plummer. Matching Theory. AMS Chelsea Publishing, 1986."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382264"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367856"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.14778\/2556549.2556576"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177698335"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1026543900054"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/1889159.1889173"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0309-y"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2882903.2882928"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973440.68"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/3236187.3236202","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T09:41:03Z","timestamp":1672220463000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/3236187.3236202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":30,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["10.14778\/3236187.3236202"],"URL":"https:\/\/doi.org\/10.14778\/3236187.3236202","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2018,7]]}}}