Main Reference PaperOptimizing Bloom Filter Settings in Peer-to-Peer Multi-keyword Searching, IEEE Transactions on Knowledge and Data Engineering, April 2012.
  • This study focuses on how to optimize the communication cost of DHT based multikeyword search using an optimal BF. It propose an optimized intersection-order strategy for multikeyword queries and presents a pushing synopsis gossip algorithm for collecting global statistical information. This robust algorithm enables every peer to quickly collect the global statistical term frequency in the P2P web.

+ Description
  • This study focuses on how to optimize the communication cost of DHT based multikeyword search using an optimal BF. It propose an optimized intersection-order strategy for multikeyword queries and presents a pushing synopsis gossip algorithm for collecting global statistical information. This robust algorithm enables every peer to quickly collect the global statistical term frequency in the P2P web.

  • To utilize Bloom Filters (BFs) encoding to effectively reduce the traffic cost during the intersection/union operations

  • To address the problem of optimizing the settings of a BF.

  • To demonstrate how to obtain optimal settings through numerical analysis

+ Aim & Objectives
  • To utilize Bloom Filters (BFs) encoding to effectively reduce the traffic cost during the intersection/union operations

  • To address the problem of optimizing the settings of a BF.

  • To demonstrate how to obtain optimal settings through numerical analysis

  • For a query with more than two keywords, it is intuitive that there is much benefit if we first perform distributed intersection operations for the pairs of keywords that have smaller size of intersection. However, it is difficult to estimate the size of intersection incurred by two keywords before we get the exact intersection.

+ Contribution
  • For a query with more than two keywords, it is intuitive that there is much benefit if we first perform distributed intersection operations for the pairs of keywords that have smaller size of intersection. However, it is difficult to estimate the size of intersection incurred by two keywords before we get the exact intersection.

  • Java JDK 1.8, MySQL 5.5.40

  • J2SE, Java Swing

+ Software Tools & Technologies
  • Java JDK 1.8, MySQL 5.5.40

  • J2SE, Java Swing

  • B.E / B.Tech / M.E / M.Tech

+ Project Recommended For
  • B.E / B.Tech / M.E / M.Tech

Professional Ethics: We S-Logix would appreciate the students those who willingly contribute with atleast a line of thinking of their own while preparing the project with us. It is advised that the project given by us be considered only as a model project and be applied with confidence to contribute your own ideas through our expert guidance and enrich your knowledge.