Anderson Rogerio Cunha, S. S. T. D. Oliveira, Thiago Borges de Oliveira, E. L. Aleixo, Marcelo de Castro Cardoso, Vagner José do Sacramento Rodrigues
{"title":"多空间数据集的分布式空间连接处理——多路空间连接","authors":"Anderson Rogerio Cunha, S. S. T. D. Oliveira, Thiago Borges de Oliveira, E. L. Aleixo, Marcelo de Castro Cardoso, Vagner José do Sacramento Rodrigues","doi":"10.1109/SBRC.2015.29","DOIUrl":null,"url":null,"abstract":"This paper proposes the Distributed Synchronous Traversal algorithm (DST) for distributed processing of spatial join with multiple datasets (Multi-way Spatial Join). It was evaluated over clusters up to eight servers, and just like the Synchronous Traversal algorithm, performs spatial join by synchronously traversing the input R-Trees. The experiments results on real datasets have shown that the algorithm provides a satisfactory degree of horizontal scalability.","PeriodicalId":307266,"journal":{"name":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Distributed Spatial Join Processing for Multiple Spatial Datasets - Multi-way Spatial Join\",\"authors\":\"Anderson Rogerio Cunha, S. S. T. D. Oliveira, Thiago Borges de Oliveira, E. L. Aleixo, Marcelo de Castro Cardoso, Vagner José do Sacramento Rodrigues\",\"doi\":\"10.1109/SBRC.2015.29\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes the Distributed Synchronous Traversal algorithm (DST) for distributed processing of spatial join with multiple datasets (Multi-way Spatial Join). It was evaluated over clusters up to eight servers, and just like the Synchronous Traversal algorithm, performs spatial join by synchronously traversing the input R-Trees. The experiments results on real datasets have shown that the algorithm provides a satisfactory degree of horizontal scalability.\",\"PeriodicalId\":307266,\"journal\":{\"name\":\"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-05-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SBRC.2015.29\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 XXXIII Brazilian Symposium on Computer Networks and Distributed Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBRC.2015.29","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper proposes the Distributed Synchronous Traversal algorithm (DST) for distributed processing of spatial join with multiple datasets (Multi-way Spatial Join). It was evaluated over clusters up to eight servers, and just like the Synchronous Traversal algorithm, performs spatial join by synchronously traversing the input R-Trees. The experiments results on real datasets have shown that the algorithm provides a satisfactory degree of horizontal scalability.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
