Project Login
Registration No:
Password:
MAIL ALERTS SMS ALERTS
 
     
   
     

BloomCast: Efficient and Effective Full-Text Retrieval in Unstructured P2P Networks

Platform : java

IEEE Projects Years : 2012 - 13

Abstract

               Efficient and effective full-text retrieval in unstructured peer-to-peer networks remains a challenge in the research community. First, it is difficult, if not impossible, for unstructured P2P systems to effectively locate items with guaranteed recall. Second, existing schemes to improve search success rate often rely on replicating a large number of item replicas across the wide area network, incurring a large amount of communication and storage costs. In this paper, we propose BloomCast, an efficient and effective full-text retrieval scheme, in unstructured P2P networks. By leveraging a hybrid P2P protocol, BloomCast replicates the items uniformly at random across the P2P networks, achieving a guaranteed recall at a communication cost of O. Furthermore, by casting Bloom Filters instead of the raw documents across the network, BloomCast significantly reduces the communication and storage costs for replication. We demonstrate the power of BloomCast design through both mathematical proof and comprehensive simulations based on the query logs from a major commercial search engine and NIST TREC WT10G data collection. Results show that BloomCast achieves an average query recall of 91 percent, which outperforms the existing WP algorithm by 18 percent, while BloomCast greatly reduces the search latency for query processing by 57 percent.      

Existing System: 

 

  • Unstructured P2Ps are commonly believed to be the best candidate for supporting full-text retrieval  because the query evaluation operations can be   handled at the nodes that store the relevant documents.
  • Little is known about the performance of the full text search using selected keyword publishing, because a few selected frequent terms may not be representative for a document  and such replication
  • strategy may incur unacceptable storage and communication cost
  • Existing P2P content search schemes can be divided into two types: DHT-based distributed global inverted index on top of unstructured P2P networks, and federated search engines over unstructured P2P networks .There is no proper utilization.

Proposed System

  • With the emergence of peer-to-peer (P2P) file sharing

Applications, such as Napster and Gnutella, millions of users have used P2P systems to search desired data. A P2P network has also shown great potential to become a popular network tool for sharing information on the Internet.

  • Replication strategies are extensively utilized to improve

search performance in unstructured P2Ps. The existing replication strategies can be divided into two categories.

 The first type is the query popularity aware strategies.

 The second type of replication strategy is independent of the popularity of the query, such as the WP scheme  By replicating data and query replicas randomly across a P2P network regardless of the query rate of the data, such kind of schemes improve search recall of queries no matter they are popular or not.

 

Hardware Requirement:

PROCESSOR             :          PENTIUM IV 2.6 GHz

RAM                           :           512 MB DD RAM

MONITOR                 :           15” COLOR

HARD DISK               :          20 GB

FLOPPY DRIVE         :         1.44 MB

CDDRIVE                   :          LG 52X

KEYBOARD                :        STANDARD 102 KEYS

MOUSE                       :          3 BUTTON

Software Requirement:

 Front End              : JSP

Server                    : Glass Fish Server 3.1 (Web Server)

Backend                : SQL Server 2008

Tools Used            :  NetbeansIDE 6.0

Operating System:  Windows XP/7

Module Description:

  • Authentication Module.
  • User Module
  • Query Search Module.
  • Text Retrieval Module.
  • Admin Module

Authentication Module:

                                           In this module   we are having the Registration field new user and then login module for already registered user  and also  we are having the login module fro admin also.

 

 

 

 

 

BloomCast: Efficient and Effective Full-Text

           Retrieval in Unstructured P2P Networks         

 

 

 

 

 

 User Module:

                                  With can enter the user module throw proper registration and proper login by using  an authentication module. Then we can perform lot of user management activities. There are following

  • Sending mail from one user to another user
  • Receiving mail from one user to another user
  • Replying for sender.
  • Clear the unwanted Mails
  • Viewing of send Item.
  • File separation along with file type like(.JPG,.PNG……….);
  • Sign-out our Account.

Query Search Module:

                      In this we can search the information from a  server and also we can Retrieve the data from server. And also we can login the  server Account from your server.

And also we are putting the contact details and About  server details for user and admin convenient purpose.

Text Retrieval Module:

In this we have implements the two specific technique. There are following

  • Replication strategies are extensively utilized to improve Search Performance
  • The second type of replication strategy is independent of the popularity of the Query.

Throw this two technique we can Retrieve the full text from Server Account and NCCT Server.

Admin Module:

In this module we are having all those management details. There are following

  • Manage the Registered User.
  • Maintain the login user Details.
  • Maintain the data transfer between one user to another user.
  • Maintain user file details.
  • Maintain the query search Details.

NOW GET PROJECTS ! GET TRAINED ! GET PLACED !

IEEE, NON-IEEE, REAL TIME LIVE ACADEMIC PROJECTS,

PROJECTS WITH COMPLETE COURSES,SOFT SKILLS & PLACEMENTS

ALLOVER INDIA & WORLD WIDE,

HOSTEL FACILITY AVAILABLE FOR GIRLS & BOYS SEPARATELY,

CALL: 08985129129 ,  E-Mail Id: support@ascentit.in

REGISTER FOR PROJECTS NOW ! GET DISCOUNT
   
1