Research on privacy preservation of big data challenges and real time applications

Abstract

Our examination work is the most slanting since it relates to the security issues which increase, well ordered in view of the casual association inclines in society. In this paper we address the issue of uncovering an individual's information; the philosophy depends for the most part on the K-anonymity with the possibility of unimportant theory, which gets the property of the release strategy not to ravage the data more than anticipated to achieve K-lack of definition. We talk about the colossal data in detail how it is useful to guarantee an immense volume of information without change the arrangement of one of a kind data. Data stored in different forms is anonymise efficiently without affecting the integrity if data by using K-Anonymity and Artificial Bee Colony algorithm respectively. We similarly give base on security and insurance strategies and to avoid the interference. We use the phony bumble bee settlement (ABC) count to propel the tremendous enlightening accumulation. We exhibit the result in graphically the sum we improve the insurance from the as of proposed system. Here both K-Anonymity and ABC Algorithm is used (mixed) which never took care by executing parallel.