K-anonymity Model Based On Distributed Database Data Privacy Security And Improved

With the development of IT technology rapidly, computer science is gradually walking into distributed computing era. According to China's scientific and technological information research institute, the definition of the so-called distributed computing is that more than two software share information with each other, which can run on the local computer, also can work on multiple computers through the network connected. That system always including distributed file system, distributed database system, etc.This thesis mainly aims at the privacy and security of distributed database. Currently, the research of privacy and security regards to distributed database basic fledgling is mostly concentrated on the identity authentication, access control and library encryption, etc. Nevertheless, little of the previous safety protection methods focus on the privacy protection of released informationK-anonymity model plays an effective role of privacy protection by suppression and generalization. Thanks to the drawbacks of the oriental model, many of academics have done plenty of research on it, and try to improve the performance of the K-anonymity. However, K-anonymity model and the later K-anonymity improved model are mostly realized based on traditional relational database. In this article, the K-anonymity model will be introduced into distributed database environment, which needs to do some improvement according to the data characteristics of distributed database.This paper presents a set of the improved K-anonymity model theory firstly, which is named DDB-K-anonymous model. And then, explaining the implementation method of the model by listing examples. Further, it design a new corresponding algorithm based on the original popular K - anonymous algorithm. Finally, a simulation experiment is available in the MATLAB to verify the usability of the new model.