| 基于语义的对等网络检索机制 |
| |
| 引用本文： | 陈明,鹿旸. 基于语义的对等网络检索机制[J]. 中山大学学报(自然科学版), 2009, 48(1) |
| |
| 作者姓名： | 陈明 鹿旸 |
| |
| 作者单位： | 1. 首都师范大学信息工程学院,北京100048;中国石油大学计算机科学与技术系,北京102249
2. 中国地质大学软件学院,北京,100083 |
| |
| 摘 要： | Content based full text search is a challenging problem in Peer to Peer (P2P) systems. A distributed P2P overlay network that supports semantic based content searches, called S-Peer, is proposed. Peers in this overlay are grouped based on the semantics of their data, and self organized as a semantic overlay network. To reduce overheads incurred by peer joining and leaving in a high dimensional overlay network, peers are constructed as a one dimensional semantic space that facilitates efficient routing. The results show the effectiveness, efficiency and scalability of the proposed system.
|
| 关 键 词： | Peer to Peer content based overlay network |
| 收稿时间： | 2008-09-18; |
Efficient Semantic-based Content Search in P2P Network |
| |
| CHEN Ming,LU Yang. Efficient Semantic-based Content Search in P2P Network[J]. Acta Scientiarum Naturalium Universitatis Sunyatseni, 2009, 48(1) |
| |
| Authors: | CHEN Ming LU Yang |
| |
| Abstract: | Content-based full-text search is a challenging problem in Peer-to-Peer (P2P) systems. A distributed P2P overlay network that supports semantic-based content searches, called S-Peer, is proposed. Peers in this overlay are grouped based on the semantics of their data, and self-organized as a semantic overlay network. To reduce overheads incurred by peer joining and leaving in a high-dimensional overlay network, peers are constructed as a one-dimensional semantic space that facilitates efficient routing. The results show the effectiveness, efficiency and scalability of the proposed system. |
| |
| Keywords: | P2P Peer-to-Peer content-based overlay network |
| 本文献已被 维普 万方数据 等数据库收录！ |
| 点击此处可从《中山大学学报(自然科学版)》浏览原始摘要信息 |
|
点击此处可从《中山大学学报(自然科学版)》下载全文 |
