基于结构化P2P的语义查询技术

侯祥松; 曹元大; 关志涛; 张昱

doi:10.3724/SP.J.1146.2007.01681

基于结构化P2P的语义查询技术

doi: 10.3724/SP.J.1146.2007.01681

侯祥松^{①;曹元大},
曹元大,
关志涛,
张昱

计量
- 文章访问数: 3025
- HTML全文浏览量: 79
- PDF下载量: 917
- 被引次数: 0
出版历程
- 收稿日期: 2007-10-24
- 修回日期: 2008-03-17
- 刊出日期: 2009-03-19

Semantic Search Based on Structured P2P

摘要

摘要: 由于P2P系统可以高效地对资源进行共享而受到关注，但现在的P2P仅支持精确查找或者通过洪泛方式进行低效率文本检索。为了解决这个问题，该文提出了一种结构化P2P环境中的文本检索系统，使用LSH函数将高维语义相关的文本向量映射相近的节点上，并解决了由此带来的负载均衡问题。实验结果显示该系统具有很好的查询准确率和负载均衡性能。
- 对等网络;语义查询;位置敏感函数
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.

HTML全文

参考文献(1)

Ratnasamy S, Francis P, and Handley M, et al.. A scalablecontent-addressable network. Proceedings of ACMSIGCOMM 2001. San Diego, CA: 2001, Vol. 31: 161-172.[2]Stoica I, Morris R, and Karger D, et al.. Chord: a scalablepeer-to-peer lookup service for Internet applications. ACMSIGCOMM 2001. San Diego, CA, USA: 2001, Vol. 31: 149.[3]Shu Y, Ooi B C, and Tan K L, et al.. Supporting MultidimensionalRange Queries in Peer-to-Peer Systems. FifthIEEE International Conference on Peer-to-Peer Computing,P2P 2005. Konstanz, Germany: 2005: 173-180.[4]侯祥松, 曹元大. 一种支持结构化 P2P 的多维范围查找方法.北京理工大学学报, 2007, 27(6): 517-520.Hou Xiang-song and Cao Yuan-da. Structured P2P searchmethod to support multi-dimensional range queries. Journalof Beijing Institute of Technology, 2007, 27(6): 517-520.[5]Tang C, Xu Z, and Mahalingam M. pSearch: Informationretrieval in structured overlays. Computer CommunicationReview, 2003, 33(1): 89-94.[6]Berry M W, Drmac Z, and Jessup E R. Matrices, vectorspaces, and information retrieval[J].SIAM Review.1999, 41(2):335-362[7]Zhu Y, Wang H, and Hu Y. Integrating semantics-basedaccess mechanisms with P2P file systems. Proceedings ofthe third International Conference on Peer-to-PeerComputing, 2003. (P2P 2003). Sweden: 2003: 118-125.[8]Bhattacharya I, Kashyap S R, and Parthasarathy S.Similarity Searching in Peer-to-Peer Databases.Proceedings of the 25th IEEE International Conference onDistributed Computing Systems, 2005. ICDCS 2005.Columbus, Ohio, USA: 2005: 329-338.[9]Bawa M, Condie T, and Ganesan P. LSH forest: Self-tuningindexes for similarity search. Proceedings of the 14thinternational conference on World Wide Web. Chiba, Japan:2005: 651-660.[10]凌波, 周水庚, 周傲英. P2P 信息检索系统的查询结果排序与合并策略. 计算机学报, 2007, 30(3): 405-414.Ling Bo, Zhou Shui-Geng, and Zhou Ao-Ying. A strategy ofquery result ranking and merging for P2P informationretrieval systems. Chinese Journal of Computers, 2007, 30(3):405-414.[11]Salton G, Wong A, and Yang C S. A vector space model forautomatic indexing[J].Communications of the ACM.1975,18(11):613-620[12]Datar M, Indyk P, and Immorlica N, et al.. Locality-sensitivehashing scheme based on p-stable distributions.Proceedings of the Twentieth Annual Symposium onComputational Geometry (SCG'04). Brooklyn, NY, UnitedStates: 2004: 253-262.[13]Pagh R and Rodler F F. Cuckoo hashing. Proceedings ofthe 9th Annual European Symposium. Algorithms-ESA 2001.Arhus, Denmark: 2001: 121-133.

施引文献

资源附件(0)

访问统计