Distributed Database using Randomized Response Technique in FP Tree Algorithm
Jyotirmayee Rautaray1, Raghvendra Kumar2
1Jyotirmayee Rautaray, Department of Computer Engineering, KIIT University, Odisha, India.
2Raghvendra Kumar, Department of Computer Engineering, KIIT University, Odisha, India.
Manuscript received on 07 February 2013 | Revised Manuscript received on 21 February 2013 | Manuscript Published on 28 February 2013 | PP: 35-39 | Volume-2 Issue-3, February 2013 | Retrieval Number: C0412022313/2013©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Data mining is broadly used in all walks of existence. Through the association rule mining, the practical storage space location of commodities can be found. This paper mainly uses FP-tree algorithm and combines with distributed secure sum protocol as well as secure multi party computation using randomized response technique to provide the more privacy to the distributed database in the homogeneous horizontal partitioned distributed environment.
Keywords: Distributed Secure Sum Protocol, FP Tree Algorithm, Randomized response technique, Secure Multi Party Computation.
Scope of the Article: Data mining