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: 9625
Venue: VLDB
Year: 2007
Pagerank: 4.6554316e-05
Overall Rank: 7,772 | 45.94%
DOI: -

Incoming Non-self Citations Over Time

Authors

1. Tochukwu Iwuchukwu
2. Jeffrey F. Naughton

Incoming Citations (Sorted by Pagerank)

Showing 3 of 3 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
8,794	Dynamic Anonymization: Accurate Statistical Analysis with Privacy Preservation	2008	SIGMOD	4.4502028e-05
9,338	Preservation of Proximity Privacy in Publishing Numerical Sensitive Data	2008	SIGMOD	4.3556432e-05
12,229	Non-homogeneous Generalization in Privacy Preserving Data Publishing	2010	SIGMOD	4.1945683e-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.0032169493
6	The R*-tree: An Efficient and Robust Access Method for Points and Rectangles	1990	SIGMOD	0.0016162015
24	The R+-Tree: A Dynamic Index For Multi-Dimensional Objects	1987	VLDB	0.00083378538
225	Generalizing Data to Provide Anonymity when Disclosing Information	1998	PODS	0.00032707646
290	Linear Clustering of Objects with Multiple Attributes	1990	SIGMOD	0.00028919734
354	Hilbert R-tree: An Improved R-tree Using Fractals	1994	VLDB	0.00026137988
455	Incognito: Efficient Full-Domain K-Anonymity	2005	SIGMOD	0.00022717354
769	Client-Server Paradise	1994	VLDB	0.00016918508
1,580	The New Casper: Query Processing for Location Services without Compromising Privacy	2006	VLDB	0.00011270239
1,633	Injecting Utility into Anonymized Datasets	2006	SIGMOD	0.00011060784
2,136	A Generic Approach to Bulk Loading Multidimensional Index Structures	1997	VLDB	9.4721139e-05
3,650	The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree	2004	SIGMOD	6.8783391e-05
9,207	Rethinking Choices for Multi-dimensional Point Indexing: Making the Case for the Often Ignored Quadtree	2007	CIDR	4.3733038e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
3,381	Privacy-preserving Anonymization of Set-valued Data	2008	VLDB	7.1604078e-05
2	R-Trees: A Dynamic Index Structure For Spatial Searching	1984	SIGMOD	0.0032169493
6,482	Approximate Algorithms for k-Anonymity	2007	SIGMOD	5.045711e-05
1,735	On k-Anonymity and the Curse of Dimensionality	2005	VLDB	0.00010723402
304	On the Complexity of Optimal K-Anonymity	2004	PODS	0.00028290121
2,678	Effectively Learning Spatial Indices	2020	VLDB	8.3252088e-05
9,767	Adaptive Indexing of Objects with Spatial Extent	2023	VLDB	4.2856106e-05
2,815	Achieving Anonymity via Clustering	2006	PODS	8.0702535e-05
455	Incognito: Efficient Full-Domain K-Anonymity	2005	SIGMOD	0.00022717354
4,979	Fast Data Anonymization with Low Information Loss	2007	VLDB	5.7878768e-05