Implementing privacy using modified tree and map technique

To Publish the personal information of the person without disclosing their sensitive information in the public is one of the major goal of implementing privacy. Various methods like k-anonymity, l-diversity, t-closeness have been proposed for implementing privacy. In this research paper, we will see a better approach of implementing k-anonymity along with t-closeness and l-diversity with the goal of improving time complexity for retrieving result validating condition of l-diversity and t-closeness as well as insertion of data also in real time. The idea will be implemented using tree data structure and standard template library map data structure which will provide results of searching and insertion of data in real time. For security reason, we present an approach where we don't have to publish the whole database, certain piece of information is enough for analysis purpose and will serve like whole database.