Articles in Press

Accepted articles here

Latest Issues

Volume 17 Issue 1

Volume 16 Issue 3
Volume 16 Issue 2
Volume 16 Issue 1

Volume 15 Issue 3
Volume 15 Issue 2
Volume 15 Issue 1

Volume 14 Issue 3
Volume 14 Issue 2
Volume 14 Issue 1

Volume 13 Issue 3
Volume 13 Issue 2
Volume 13 Issue 1

Volume 12 Issue 3
Volume 12 Issue 2
Volume 12 Issue 1

Volume 11 Issue 3
Volume 11 Issue 2
Volume 11 Issue 1

Volume 10 Issue 3
Volume 10 Issue 2
Volume 10 Issue 1

Volume 9 Issue 3
Volume 9 Issue 2
Volume 9 Issue 1

Volume 8 Issue 3
Volume 8 Issue 2
Volume 8 Issue 1

Volume 7 Issue 3
Volume 7 Issue 2
Volume 7 Issue 1

Volume 6 Issue 3
Volume 6 Issue 2
Volume 6 Issue 1

Volume 5 Issue 3
Volume 5 Issue 2
Volume 5 Issue 1

Volume 4 Issue 3
Volume 4 Issue 2
Volume 4 Issue 1

Volume 3 Issue 3
Volume 3 Issue 2
Volume 3 Issue 1

Volume 2 Issue 3
Volume 2 Issue 2
Volume 2 Issue 1

Volume 1 Issue 3
Volume 1 Issue 2
Volume 1 Issue 1

Volume 6 Issue 1

Achieving k-anonymity Using Improved Greedy Heuristics for Very Large Relational Databases

Korra Sathya Babu^(a), Nithin Reddy^(a), Nitesh Kumar^(a), Mark Elliot^(b),(*), Sanjay Kumar Jena^(a)

Transactions on Data Privacy 6:1 (2013) 1 - 17

Abstract, PDF

(a) Advanced Data Engineering Laboratory, Department of Computer Science & Engineering, National Institute of Technology Rourkela, India.

(b) Centre for Census and Survey Research, School of Social Sciences, University of Manchester, UK.

e-mail:fksathyababu @nitrkl.ac.in; rnithinr-cs43 @nitrkl.ac.in; niteshk-cs64 @nitrkl.ac.in; mark.elliot @manchester.ac.uk; skjenag @nitrkl.ac.in

Abstract

Advances in data storage, data collection and inference techniques have enabled the creation of huge databases of personal information. Dissemination of information from such databases - even if formally anonymised, creates a serious threat to individual privacy through statistical disclosure. One of the key methods developed to limit statistical disclosure risk is k-anonymity. Several methods have been proposed to enforce k-anonymity notably Samarati's algorithm and Sweeney's Datafly, which both adhere to full domain generalisation. Such methods require a trade off between computing time and information loss. This paper describes an improved greedy heuristic for enforcing k-anonymity with full domain generalisation. The improved greedy algorithm was compared with the original methods. Metrics like information loss, computing time and level of generalisation were deployed for comparison. Results show that the improved greedy algorithm maintains a better balance between computing time and information loss.

^* Corresponding author.

Follow us

Supports