Effective Data Retrieval System with Bloom in a Unstructured p2p Network
Thumil Vannan .P.S1, S. Uvaraj2
1Thumil Vannan .P.S, M.E, CSE Dept, Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai Dt, Near Kanchipuram, India.
2S. Uvaraj, M.E, Arulmigu Meenakshi Amman College of Engineering, Thiruvannamalai Dt, Near Kanchipuram, India.
Manuscript received on March 02, 2013. | Revised Manuscript received on April 13, 2013. | Manuscript published on April 30, 2013. | PP: 383-385 | Volume-2, Issue-4, April 2013. | Retrieval Number: D1451042413/2013©BEIESP
Open Access | Ethics and Policies | Cite
© 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: Bloomcast, an efficient and effective full-text retrieval scheme, in unstructured P2P networks. Bloomcast is effective because it guarantees perfect recall rate with high probability. It is efficient because the overall communication cost of full-text search is reduced below a formal bound. Furthermore casting bloom filters instead of raw data across the network. Bloomcast reduces the communication cost and storage cost for replication. Bloomcast replicates the items uniformly at random across the P2P networks, achieving a guaranteed recall at a communication cost of O(√N), where N is the size of the network. The main contribution of this proposal of Bloomcast design through both mathematical proof and comprehensive simulations.
Keywords: P2P O(√N).