Database Paper Browser

Back to papers

Fast Data Anonymization with Low Information Loss

Summary: One-dimensional quasi-identifiers enable linear-time heuristics for k-anonymity and l-diversity with meaningful information-loss metrics. Space-mapping generalizes to multi-dimensional data, yielding faster anonymization with lower loss and beating state-of-the-art in time and quality. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
9627
Venue
VLDB
Year
2007
Pagerank
5.7878768e-05
Overall Rank
4,979 | 65.37%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank Citing Paper Year Venue Pagerank
2,406 Attacks on Privacy and deFinetti's Theorem 2009 SIGMOD 8.8811954e-05
3,381 Privacy-preserving Anonymization of Set-valued Data 2008 VLDB 7.1604078e-05
8,794 Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation 2008 SIGMOD 4.4502028e-05
9,336 Small Domain Randomization: Same Privacy, More Utility 2010 VLDB 4.3556432e-05
9,338 Preservation of Proximity Privacy in Publishing Numerical Sensitive Data 2008 SIGMOD 4.3556432e-05
10,046 Aegis: A Correlation-Based Data Masking Advisor for Data-Sharing Ecosystems 2026 SIGMOD 4.1945683e-05
11,470 When the Recursive Diversity Anonymity Meets the Ring Signature 2021 SIGMOD 4.1945683e-05
12,229 Non-homogeneous Generalization in Privacy Preserving Data Publishing 2010 SIGMOD 4.1945683e-05
12,327 TIAMAT: a Tool for Interactive Analysis of Microdata Anonymization Techniques 2009 VLDB 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
11 Implementing Data Cubes Efficiently 1996 SIGMOD 0.0011708144
225 Generalizing Data to Provide Anonymity when Disclosing Information 1998 PODS 0.00032707646
304 On the Complexity of Optimal K-Anonymity 2004 PODS 0.00028290121
455 Incognito: Efficient Full-Domain K-Anonymity 2005 SIGMOD 0.00022717354
654 Anatomy: Simple and Effective Privacy Preservation 2006 VLDB 0.00018613167
1,633 Injecting Utility into Anonymized Datasets 2006 SIGMOD 0.00011060784
2,682 Personalized Privacy Preservation 2006 SIGMOD 8.3202837e-05
2,815 Achieving Anonymity via Clustering 2006 PODS 8.0702535e-05
Previous Page 1 / 1 Next

Semantically Similar Papers

Overall Rank Paper Year Venue Pagerank
12,229 Non-homogeneous Generalization in Privacy Preserving Data Publishing 2010 SIGMOD 4.1945683e-05
4,524 Anonymization of Set-Valued Data via Top-Down, Local Generalization 2009 VLDB 6.1133444e-05
304 On the Complexity of Optimal K-Anonymity 2004 PODS 0.00028290121
455 Incognito: Efficient Full-Domain K-Anonymity 2005 SIGMOD 0.00022717354
1,735 On k-Anonymity and the Curse of Dimensionality 2005 VLDB 0.00010723402
225 Generalizing Data to Provide Anonymity when Disclosing Information 1998 PODS 0.00032707646
6,482 Approximate Algorithms for k-Anonymity 2007 SIGMOD 5.045711e-05
2,815 Achieving Anonymity via Clustering 2006 PODS 8.0702535e-05
8,930 Privacy Preservation by Disassociation 2012 VLDB 4.427232e-05
3,381 Privacy-preserving Anonymization of Set-valued Data 2008 VLDB 7.1604078e-05