K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization

Summary: K-anonymization reframed as spatial indexing with R-trees, enabling scalable, incremental anonymization. Batch anonymization with R-trees delivers orders-of-magnitude speedups and yields superior quality by standard metrics through effective partitioning. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 9816
Venue: VLDB
Year: 2007
Pagerank: 5.5777517e-05
Overall Rank: 7,632 | 47.64%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Tochukwu Iwuchukwu (University of Wisconsin)
2. Jeffrey F. Naughton (University of Wisconsin)

BibTeX Citation

@article{iwuchukwu_vldb07,
        title = {{K-Anonymization as Spatial Indexing: Toward Scalable and Incremental Anonymization}},
        author = {Iwuchukwu, Tochukwu and Naughton, Jeffrey F.},
        journal = {PVLDB},
        series = {{VLDB} '07},
        pages = {746--757},
        year = {2007}
}

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
9,001	Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation	2008	SIGMOD	5.334788e-05
9,487	Preservation of Proximity Privacy in Publishing Numerical Sensitive Data	2008	SIGMOD	5.2634238e-05
12,424	Non-homogeneous Generalization in Privacy Preserving Data Publishing	2010	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0020210012
4	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.001157935
42	The R+-Tree: A Dynamic Multi-Dimensional Index for Objects	1987	VLDB	0.00046170812
329	Hilbert R-tree: An Improved R-tree Using Fractals	1994	VLDB	0.00021068647
338	Generalizing Data to Provide Anonymity when Disclosing Information	1998	PODS	0.00020731054
354	Linear Clustering of Objects with Multiple Attributes	1990	SIGMOD	0.00020355578
450	Incognito: Efficient Full-Domain K-Anonymity	2005	SIGMOD	0.00018155142
726	Client-Server Paradise	1994	VLDB	0.0001460632
1,669	Injecting Utility into Anonymized Datasets	2006	SIGMOD	0.00010050522
1,734	The New Casper: Query Processing for Location Services without Compromising Privacy	2006	VLDB	9.9009944e-05
1,901	A Generic Approach to Bulk Loading Multidimensional Index Structures	1997	VLDB	9.5068846e-05
3,593	The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree	2004	SIGMOD	7.2750277e-05
9,365	Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree	2007	CIDR	5.279561e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	3,232	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB
2	2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD
3	6,554	Approximate Algorithms for k-Anonymity	2007	SIGMOD
4	1,817	On k-Anonymity and the Curse of Dimensionality	2005	VLDB
5	384	On the Complexity of Optimal K-Anonymity	2004	PODS
6	9,887	Adaptive Indexing of Objects with Spatial Extent	2023	VLDB
7	1,840	Effectively Learning Spatial Indices	2020	VLDB
8	3,110	Achieving Anonymity via Clustering	2006	PODS
9	450	Incognito: Efficient Full-Domain K-Anonymity	2005	SIGMOD
10	4,699	Fast Data Anonymization with Low Information Loss	2007	VLDB