DocumentCode :
3124097
Title :
Efficient Table Anonymization for Aggregate Query Answering
Author :
Procopiuc, Cecilia M. ; Srivastava, Divesh
Author_Institution :
Res. Labs., AT&T, Florham Park, NJ
fYear :
2009
fDate :
March 29 2009-April 2 2009
Firstpage :
1291
Lastpage :
1294
Abstract :
Privacy protection is a major concern when microdata is released for ad hoc analyses. Anonymization schemes have to guarantee privacy goals, as well as preserve sufficient information to support reasonably accurate answers to ad hoc queries. In this paper, we focus on the case when the sensitive attributes are numerical (e.g., salary) for which (k,e)-anonymity was shown to be an appropriate privacy goal. We develop efficient algorithms for two optimization criteria for (k,e)-anonymity schemes, significantly improving on previous results. We evaluate our methods on a large real dataset, and show that they are scalable and accurate.
Keywords :
data privacy; optimisation; query processing; ad hoc queries; aggregate query answering; for ad hoc analyses; optimization criteria; privacy protection; table anonymization; Aggregates; Cost function; Data engineering; Data privacy; Partitioning algorithms; Protection; Public healthcare; Remuneration; Sorting; USA Councils;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Data Engineering, 2009. ICDE '09. IEEE 25th International Conference on
Conference_Location :
Shanghai
ISSN :
1084-4627
Print_ISBN :
978-1-4244-3422-0
Electronic_ISBN :
1084-4627
Type :
conf
DOI :
10.1109/ICDE.2009.223
Filename :
4812523
Link To Document :
بازگشت