Abstract
Peer-to-Peer (P2P) overlays are appealing, since they can aggregate resources of end systems without relying on sophisticated infrastructures. Unfortunately current peer-to-peer systems either offer exact keyword match or provide inefficient text search methods through centralized indexing or flooding. In this paper, a semantic search system is proposed for structured P2P overlays without relying on message flooding. LSH is used to map semantically related text vector to nearly node, and a mechanism is carefully designed to cope with load balancing. Experimental results show that this is a steady system with high recall, good load balance.
Original language | English |
---|---|
Pages (from-to) | 707-710 |
Number of pages | 4 |
Journal | Dianzi Yu Xinxi Xuebao/Journal of Electronics and Information Technology |
Volume | 31 |
Issue number | 3 |
Publication status | Published - Mar 2009 |
Keywords
- Locality-sensitive hashing
- Peer to Peer (P2P)
- Semantic search