K. Lin, Shuo-Chan Tsai, Yi-Ting Chang, Cheng-Fu Chou
{"title":"基于小世界的P2P系统中搜索和相似搜索的实现","authors":"K. Lin, Shuo-Chan Tsai, Yi-Ting Chang, Cheng-Fu Chou","doi":"10.1109/ICCCN.2007.4317806","DOIUrl":null,"url":null,"abstract":"Recently, peer-to-peer systems have become one of the most popular distributed applications. Many previous works have investigated identifier-based indexing systems that support a query-by-identifier service. However, clients usually have only partial information about an object, and prefer to query by keywords. In this paper, we propose a small-world-based keyword search system (SW-KSS) that provides keyword search and similarity search services simultaneously. The proposed SW-KSS applies the concept of the \"small world theory\" to the construction of an indexing structure. Such structures mirror the way humans keep track of their friends and acquaintances; hence, they can cluster peers who share common interests. The method enables a peer to And objects of interest from similar neighboring peers efficiently. We evaluate the performance of SW-KSS via simulations. The results show that SW-KSS can achieve both scalability and partial-match look-up capability.","PeriodicalId":388763,"journal":{"name":"2007 16th International Conference on Computer Communications and Networks","volume":"191 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Enabling Search and Similarity Search in Small-World-based P2P Systems\",\"authors\":\"K. Lin, Shuo-Chan Tsai, Yi-Ting Chang, Cheng-Fu Chou\",\"doi\":\"10.1109/ICCCN.2007.4317806\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recently, peer-to-peer systems have become one of the most popular distributed applications. Many previous works have investigated identifier-based indexing systems that support a query-by-identifier service. However, clients usually have only partial information about an object, and prefer to query by keywords. In this paper, we propose a small-world-based keyword search system (SW-KSS) that provides keyword search and similarity search services simultaneously. The proposed SW-KSS applies the concept of the \\\"small world theory\\\" to the construction of an indexing structure. Such structures mirror the way humans keep track of their friends and acquaintances; hence, they can cluster peers who share common interests. The method enables a peer to And objects of interest from similar neighboring peers efficiently. We evaluate the performance of SW-KSS via simulations. The results show that SW-KSS can achieve both scalability and partial-match look-up capability.\",\"PeriodicalId\":388763,\"journal\":{\"name\":\"2007 16th International Conference on Computer Communications and Networks\",\"volume\":\"191 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-09-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 16th International Conference on Computer Communications and Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCN.2007.4317806\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 16th International Conference on Computer Communications and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN.2007.4317806","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Enabling Search and Similarity Search in Small-World-based P2P Systems
Recently, peer-to-peer systems have become one of the most popular distributed applications. Many previous works have investigated identifier-based indexing systems that support a query-by-identifier service. However, clients usually have only partial information about an object, and prefer to query by keywords. In this paper, we propose a small-world-based keyword search system (SW-KSS) that provides keyword search and similarity search services simultaneously. The proposed SW-KSS applies the concept of the "small world theory" to the construction of an indexing structure. Such structures mirror the way humans keep track of their friends and acquaintances; hence, they can cluster peers who share common interests. The method enables a peer to And objects of interest from similar neighboring peers efficiently. We evaluate the performance of SW-KSS via simulations. The results show that SW-KSS can achieve both scalability and partial-match look-up capability.