{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:26Z","timestamp":1761611246271,"version":"3.41.0"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T00:00:00Z","timestamp":1243814400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee, Hong Kong","doi-asserted-by":"publisher","award":["HKU 715108E"],"award-info":[{"award-number":["HKU 715108E"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Database Syst."],"published-print":{"date-parts":[[2009,6]]},"abstract":"<jats:p>\n            Recent research studied the problem of publishing microdata without revealing sensitive information, leading to the privacy-preserving paradigms of\n            <jats:italic>k<\/jats:italic>\n            -anonymity and\n            <jats:italic>l<\/jats:italic>\n            -diversity.\n            <jats:italic>k<\/jats:italic>\n            -anonymity protects against the identification of an individual's record.\n            <jats:italic>l<\/jats:italic>\n            -diversity, in addition, safeguards against the association of an individual with specific sensitive information. However, existing approaches suffer from at least one of the following drawbacks: (i)\n            <jats:italic>l<\/jats:italic>\n            -diversification is solved by techniques developed for the simpler\n            <jats:italic>k<\/jats:italic>\n            -anonymization problem, causing unnecessary information loss. (ii) The anonymization process is inefficient in terms of computational and I\/O cost. (iii) Previous research focused exclusively on the privacy-constrained problem and ignored the equally important accuracy-constrained (or dual) anonymization problem.\n          <\/jats:p>\n          <jats:p>\n            In this article, we propose a framework for efficient anonymization of microdata that addresses these deficiencies. First, we focus on one-dimensional (i.e., single-attribute) quasi-identifiers, and study the properties of optimal solutions under the\n            <jats:italic>k<\/jats:italic>\n            -anonymity and\n            <jats:italic>l<\/jats:italic>\n            -diversity models for the privacy-constrained (i.e., direct) and the accuracy-constrained (i.e., dual) anonymization problems. Guided by these properties, we develop efficient heuristics to solve the one-dimensional problems in linear time. Finally, we generalize our solutions to multidimensional quasi-identifiers using space-mapping techniques. Extensive experimental evaluation shows that our techniques clearly outperform the existing approaches in terms of execution time and information loss.\n          <\/jats:p>","DOI":"10.1145\/1538909.1538911","type":"journal-article","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T13:10:17Z","timestamp":1246367417000},"page":"1-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":58,"title":["A framework for efficient data anonymization under privacy and accuracy constraints"],"prefix":"10.1145","volume":"34","author":[{"given":"Gabriel","family":"Ghinita","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Panos","family":"Kalnis","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore"}]},{"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2009,7,2]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142374"},{"key":"e_1_2_1_2_1","unstructured":"Aggarwal G. Feder T. Kenthapadi K. Motwani R. Panigrahy R. Thomas D. and Zhu A. 2005. Approximation algorithms for k-anonymity. J. Privacy Technol. Article number: 20051120001.  Aggarwal G. Feder T. Kenthapadi K. Motwani R. Panigrahy R. Thomas D. and Zhu A. 2005. Approximation algorithms for k-anonymity. J. Privacy Technol. Article number: 20051120001."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2005.42"},{"volume-title":"Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA), 188--200","author":"Byun J.-W.","key":"e_1_2_1_4_1","unstructured":"Byun , J.-W. , Kamra , A. , Bertino , E. , and Li , N . 2007. Efficient k -anonymization using clustering techniques . In Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA), 188--200 . Byun, J.-W., Kamra, A., Bertino, E., and Li, N. 2007. Efficient k -anonymization using clustering techniques. In Proceedings of the International Conference on Database Systems for Advanced Applications (DASFAA), 188--200."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2307\/1229519"},{"volume-title":"Proceedings of International Conference on Very Large Data Bases (VLDB), 758--769","author":"Ghinita G.","key":"e_1_2_1_6_1","unstructured":"Ghinita , G. , Karras , P. , Kalnis , P. , and Mamoulis , N . 2007. Fast data anonymization with low information loss . In Proceedings of International Conference on Very Large Data Bases (VLDB), 758--769 . Ghinita, G., Karras, P., Kalnis, P., and Mamoulis, N. 2007. Fast data anonymization with low information loss. In Proceedings of International Conference on Very Large Data Bases (VLDB), 758--769."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233333"},{"volume-title":"Proceedings of International Conference on Very Large Data Bases (VLDB), 746--757","author":"Iwuchukwu T.","key":"e_1_2_1_8_1","unstructured":"Iwuchukwu , T. and Naughton , J. F . 2007. k-Anonymization as spatial indexing: toward scalable and incremental anonymization . In Proceedings of International Conference on Very Large Data Bases (VLDB), 746--757 . Iwuchukwu, T. and Naughton, J. F. 2007. k-Anonymization as spatial indexing: toward scalable and incremental anonymization. In Proceedings of International Conference on Very Large Data Bases (VLDB), 746--757."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775089"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142499"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066164"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.101"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150435"},{"volume-title":"Proceedings of International Conference on Data Engineering (ICDE), 106--115","author":"Li N.","key":"e_1_2_1_14_1","unstructured":"Li , N. , Li , T. , and Venkatasubramanian , S . 2007. t-Closeness: Privacy beyond k-anonymity and l-diversity . In Proceedings of International Conference on Data Engineering (ICDE), 106--115 . Li, N., Li, T., and Venkatasubramanian, S. 2007. t-Closeness: Privacy beyond k-anonymity and l-diversity. In Proceedings of International Conference on Data Engineering (ICDE), 106--115."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055558.1055591"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.908985"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.11.006"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247490"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/69.971193"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218488502001648"},{"volume-title":"Multidimensional k-anonymization by linear clustering using space-filling curves. Tech. rep. 2006-27","author":"Wong R.","key":"e_1_2_1_22_1","unstructured":"Wong , R. , Fu , A. , Pei , J. , Wang , K. , Wan , S. , and Lo ., C. 2006. Multidimensional k-anonymization by linear clustering using space-filling curves. Tech. rep. 2006-27 , Simon Fraser University . March. Wong, R., Fu, A., Pei, J., Wang, K., Wan, S., and Lo., C. 2006. Multidimensional k-anonymization by linear clustering using space-filling curves. Tech. rep. 2006-27, Simon Fraser University. March."},{"volume-title":"Proceedings of International Conference on Very Large Data Bases (VLDB), 139--150","author":"Xiao X.","key":"e_1_2_1_23_1","unstructured":"Xiao , X. and Tao , Y . 2006a. Anatomy: Simple and effective privacy preservation . In Proceedings of International Conference on Very Large Data Bases (VLDB), 139--150 . Xiao, X. and Tao, Y. 2006a. Anatomy: Simple and effective privacy preservation. In Proceedings of International Conference on Very Large Data Bases (VLDB), 139--150."},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142473.1142500"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247556"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150504"},{"volume-title":"Proceedings of International Conference on Data Engineering (ICDE), 116--125","author":"Zhang Q.","key":"e_1_2_1_27_1","unstructured":"Zhang , Q. , Koudas , N. , Srivastava , D. , and Yu , T . 2007. Aggregate query answering on anonymized tables . In Proceedings of International Conference on Data Engineering (ICDE), 116--125 . Zhang, Q., Koudas, N., Srivastava, D., and Yu, T. 2007. Aggregate query answering on anonymized tables. In Proceedings of International Conference on Data Engineering (ICDE), 116--125."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1093382.1093383"}],"container-title":["ACM Transactions on Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1538909.1538911","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1538909.1538911","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T20:26:53Z","timestamp":1750278413000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1538909.1538911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,6]]}},"alternative-id":["10.1145\/1538909.1538911"],"URL":"https:\/\/doi.org\/10.1145\/1538909.1538911","relation":{},"ISSN":["0362-5915","1557-4644"],"issn-type":[{"type":"print","value":"0362-5915"},{"type":"electronic","value":"1557-4644"}],"subject":[],"published":{"date-parts":[[2009,6]]},"assertion":[{"value":"2008-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2009-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}