{"title":"非结构化点对点系统中基于历史的多关键词搜索","authors":"Xiaojing Sun, Feng Hong, Zhongwen Guo","doi":"10.1109/FUTURETECH.2010.5482724","DOIUrl":null,"url":null,"abstract":"Peer-to-peer approaches bring one perfect alternative for the Web content search. However, how to search and retrieve the data based on the content query is still an open problem for peer-to-peer systems. In this paper we propose Historybased Multi-keywords Search(HMS) in unstructured peer-to-peer systems, which only requires each peer to maintain partial query information of its neighbors, and exploit these information to autonomously find, for each query, how many neighbors and which neighbors are likely to answer. The simulations prove that HMS can limit the traffic of query messages while keeping the high quality of query results.","PeriodicalId":380192,"journal":{"name":"2010 5th International Conference on Future Information Technology","volume":"131 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"HMS: History-Based Multi-Keywords Search in Unstructured Peer-to-Peer Systems\",\"authors\":\"Xiaojing Sun, Feng Hong, Zhongwen Guo\",\"doi\":\"10.1109/FUTURETECH.2010.5482724\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Peer-to-peer approaches bring one perfect alternative for the Web content search. However, how to search and retrieve the data based on the content query is still an open problem for peer-to-peer systems. In this paper we propose Historybased Multi-keywords Search(HMS) in unstructured peer-to-peer systems, which only requires each peer to maintain partial query information of its neighbors, and exploit these information to autonomously find, for each query, how many neighbors and which neighbors are likely to answer. The simulations prove that HMS can limit the traffic of query messages while keeping the high quality of query results.\",\"PeriodicalId\":380192,\"journal\":{\"name\":\"2010 5th International Conference on Future Information Technology\",\"volume\":\"131 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 5th International Conference on Future Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FUTURETECH.2010.5482724\",\"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 5th International Conference on Future Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FUTURETECH.2010.5482724","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
HMS: History-Based Multi-Keywords Search in Unstructured Peer-to-Peer Systems
Peer-to-peer approaches bring one perfect alternative for the Web content search. However, how to search and retrieve the data based on the content query is still an open problem for peer-to-peer systems. In this paper we propose Historybased Multi-keywords Search(HMS) in unstructured peer-to-peer systems, which only requires each peer to maintain partial query information of its neighbors, and exploit these information to autonomously find, for each query, how many neighbors and which neighbors are likely to answer. The simulations prove that HMS can limit the traffic of query messages while keeping the high quality of query results.