{"title":"用分布式桶结构改进web搜索","authors":"V. Gil-Costa, A. M. Printista, Mauricio Marín","doi":"10.1109/LA-WEB.2006.18","DOIUrl":null,"url":null,"abstract":"This article compares several strategies for searching in Web engines and we present the bucket algorithms to improve the efficiency of a classical index data structure for parallel textual database. We use the inverted files as the data structure and the vector space model to perform the ranking of documents. The main interest is the queries parallel processing on a cluster of PCs, and therefore this paper is focused in the communication and synchronization optimization. The design of the server that processes the queries, is effected on top of the bulk synchronous-BSP model of parallel computing, to study how query performance is affected by the index organization","PeriodicalId":339667,"journal":{"name":"2006 Fourth Latin American Web Congress","volume":"396 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"ImprovingWeb Searches with Distributed Buckets Structures\",\"authors\":\"V. Gil-Costa, A. M. Printista, Mauricio Marín\",\"doi\":\"10.1109/LA-WEB.2006.18\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article compares several strategies for searching in Web engines and we present the bucket algorithms to improve the efficiency of a classical index data structure for parallel textual database. We use the inverted files as the data structure and the vector space model to perform the ranking of documents. The main interest is the queries parallel processing on a cluster of PCs, and therefore this paper is focused in the communication and synchronization optimization. The design of the server that processes the queries, is effected on top of the bulk synchronous-BSP model of parallel computing, to study how query performance is affected by the index organization\",\"PeriodicalId\":339667,\"journal\":{\"name\":\"2006 Fourth Latin American Web Congress\",\"volume\":\"396 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Fourth Latin American Web Congress\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LA-WEB.2006.18\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 Fourth Latin American Web Congress","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LA-WEB.2006.18","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
ImprovingWeb Searches with Distributed Buckets Structures
This article compares several strategies for searching in Web engines and we present the bucket algorithms to improve the efficiency of a classical index data structure for parallel textual database. We use the inverted files as the data structure and the vector space model to perform the ranking of documents. The main interest is the queries parallel processing on a cluster of PCs, and therefore this paper is focused in the communication and synchronization optimization. The design of the server that processes the queries, is effected on top of the bulk synchronous-BSP model of parallel computing, to study how query performance is affected by the index organization
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
