a popularity-aware semantic overlay for efficient peer-to-peer search

Clicks: 240
ID: 246165
2014
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This article has not been analysed, so there is no overall score — reader engagement is measured and shown alongside.
AI Quality Assessment
Not analyzed
Readership in this journal
Steady

Ranked #65 of 91 articles by views in JMIR mHealth and uHealth

Most read Least read

Bar heights use a square-root scale.

Mint this article as an NFT
Not yet minted

Create a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.

5 SUSD one-off · no wallet required
Abstract
This paper presents a novel semantic overlay scheme that connects peers based on the similarity of their contents. Semantic closeness among overlay peers can effectively be determined via the exchanges of their content summary using Bloom filters. The overlay link quality is further improved by carefully selecting semantic neighbors according to their potential to contribute to content-based searches. The basic idea behind the semantic neighbor selection is that highly replicated documents should not excessively dominate the overlay topology, overshadowing rare to modestly-replicated items whose query efficiency is often more critical for overall search performance. The efficacy of the proposed semantic overlay is validated through our simulation study which demonstrates superior overlay link quality and query routing performance.
Reference Key
c.2014advancesa Use this key to autocite in the manuscript while using SciMatic Manuscript Manager or Thesis Manager
Authors ;LEE, C.;CHOI, J.;KIM, E.
Journal JMIR mHealth and uHealth
Year 2014
DOI
10.4316/AECE.2014.04016
URL
Keywords

Citations

No citations found. To add a citation, contact the admin at info@scimatic.org

No comments yet. Be the first to comment on this article.