摘要： K-匿名是微数据发布隐私保护的一种重要方法。针对适应动态数据、实时相应等特征需求，提出基于R树的多维数据K匿名解决方案，包括对原有R树结构的改造方法及其相应的K-匿名化过程。基于Adult数据库，通过实验验证了本模型能够保证K匿名属性的正确性，同时由于分裂算法的影响，也能保证信息保存的完整性。

关键词: 数据隐私, K-匿名, 多维, R树

Abstract: K-anonymization is an important approach to protect data privacy in data publishing scenario. Like K-D tree for multidimensional K- anonymity, this paper proposes, an implementation of R tree in which each record is considered as a point in d-dimensional space of the attribute. Instead of dividing the region into pieces, the nearby rectangles are grouped into parent minimal bounding rectangles and forms disk blocks. Experiment results by modifying several parameters show that the algorithm can handle higher dimensionality compared with grid file or k-d tree.

Key words: data privacy, K-anonymization, multidimensional, R-tree

中图分类号: 

• TP391