P2P社交网络中基于语义的查询路由

2010 IEEE International Conference on Wireless Communications, Networking and Information Security Pub Date : 2010-06-25 DOI:10.1109/WCINS.2010.5544676

Mei Yu, Jianrong Wang, Qingjie Wang, Xuan Liu, Zheng Zhao, Yan Zhang

{"title":"P2P社交网络中基于语义的查询路由","authors":"Mei Yu, Jianrong Wang, Qingjie Wang, Xuan Liu, Zheng Zhao, Yan Zhang","doi":"10.1109/WCINS.2010.5544676","DOIUrl":null,"url":null,"abstract":"In P2P social networks, query efficiency is always a significant challenge. In this paper we build a semantic-based query routing strategy to improve the searching efficiency. Based on Vector Space Model (VSM), similar semantic ordinary peers set up an unstructured semantic community. Super peers in each community constitute a structured P2P network and store the keywords information in a global inverted file. We exploit Bloom Filters to complete multi-keyword query. Simulation results show that the proposed scheme is able to increase query efficiency and also reduce query cost.","PeriodicalId":156036,"journal":{"name":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","volume":"338 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Semantic-based query routing in P2P social networks\",\"authors\":\"Mei Yu, Jianrong Wang, Qingjie Wang, Xuan Liu, Zheng Zhao, Yan Zhang\",\"doi\":\"10.1109/WCINS.2010.5544676\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In P2P social networks, query efficiency is always a significant challenge. In this paper we build a semantic-based query routing strategy to improve the searching efficiency. Based on Vector Space Model (VSM), similar semantic ordinary peers set up an unstructured semantic community. Super peers in each community constitute a structured P2P network and store the keywords information in a global inverted file. We exploit Bloom Filters to complete multi-keyword query. Simulation results show that the proposed scheme is able to increase query efficiency and also reduce query cost.\",\"PeriodicalId\":156036,\"journal\":{\"name\":\"2010 IEEE International Conference on Wireless Communications, Networking and Information Security\",\"volume\":\"338 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE International Conference on Wireless Communications, Networking and Information Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCINS.2010.5544676\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 IEEE International Conference on Wireless Communications, Networking and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCINS.2010.5544676","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

在P2P社交网络中，查询效率一直是一个重要的挑战。为了提高搜索效率，本文构建了一种基于语义的查询路由策略。基于向量空间模型(VSM)，相似语义的普通对等体建立了非结构化语义社区。每个社区中的超级节点组成了一个结构化的P2P网络，并将关键字信息存储在一个全局倒置文件中。我们利用布隆过滤器来完成多关键字查询。仿真结果表明，该方法在提高查询效率的同时降低了查询成本。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Semantic-based query routing in P2P social networks

In P2P social networks, query efficiency is always a significant challenge. In this paper we build a semantic-based query routing strategy to improve the searching efficiency. Based on Vector Space Model (VSM), similar semantic ordinary peers set up an unstructured semantic community. Super peers in each community constitute a structured P2P network and store the keywords information in a global inverted file. We exploit Bloom Filters to complete multi-keyword query. Simulation results show that the proposed scheme is able to increase query efficiency and also reduce query cost.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2010 IEEE International Conference on Wireless Communications, Networking and Information Security

自引率

0.00%

发文量