Algorithms for incremental update of K-anonymity table based on multi-dimension bucket
Hongjia Li · Journal of Yanshan University · 2009
The issue on the update of K-anonymity table is fresh among the domain of view security.When a base table of the database is updated,K-anonymity table should be correspondingly updated in time.The current approach focuses on the renewable computation of K-anonymity table,which will cause a huge number of system wastes.The purpose of this paper is to reduce the time spent on the updating operation.For one thing,the concept and basic operation of multi-dimension bucket are proposed.For another,the correlation between tuples changed in the base table and multi-dimension bucket is given.Moreover,this correlation is mapped to operations on K-anonymity table.Based on this,the algorithm for incremental update of K-anonymity table based on multi-dimension bucket is given in this paper.The deficiency that K-anonymity table must be computed renewably is solved and the practical application capability of K-anonymity table is improved distinctly.