{"title":"一种并行矢量空间分析的空间数据划分与合并方法","authors":"Qiang Qiu, Xiao Yao, Cuiting Chen, Yu Liu, Jinyun Fang","doi":"10.1109/GEOINFORMATICS.2015.7378651","DOIUrl":null,"url":null,"abstract":"Based on the principle of the proximity of spatial elements and the equilibrium of spatial data's size, this paper presents a data partitioning and merging method based on spatial filling curve and collection of spatial features. In the data reducing section, this method takes the principle of dynamic tree merging and reduces the times of data serialization and deserialization. The experiment shows that such methods can cut down the time of every process' computing and merging, improve the load balancing degree, and make a great improvement to the efficiency of parallel algorithm and expandability.","PeriodicalId":371399,"journal":{"name":"2015 23rd International Conference on Geoinformatics","volume":"80 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A spatial data partitioning and merging method for parallel vector spatial analysis\",\"authors\":\"Qiang Qiu, Xiao Yao, Cuiting Chen, Yu Liu, Jinyun Fang\",\"doi\":\"10.1109/GEOINFORMATICS.2015.7378651\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the principle of the proximity of spatial elements and the equilibrium of spatial data's size, this paper presents a data partitioning and merging method based on spatial filling curve and collection of spatial features. In the data reducing section, this method takes the principle of dynamic tree merging and reduces the times of data serialization and deserialization. The experiment shows that such methods can cut down the time of every process' computing and merging, improve the load balancing degree, and make a great improvement to the efficiency of parallel algorithm and expandability.\",\"PeriodicalId\":371399,\"journal\":{\"name\":\"2015 23rd International Conference on Geoinformatics\",\"volume\":\"80 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 23rd International Conference on Geoinformatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GEOINFORMATICS.2015.7378651\",\"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 23rd International Conference on Geoinformatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GEOINFORMATICS.2015.7378651","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A spatial data partitioning and merging method for parallel vector spatial analysis
Based on the principle of the proximity of spatial elements and the equilibrium of spatial data's size, this paper presents a data partitioning and merging method based on spatial filling curve and collection of spatial features. In the data reducing section, this method takes the principle of dynamic tree merging and reduces the times of data serialization and deserialization. The experiment shows that such methods can cut down the time of every process' computing and merging, improve the load balancing degree, and make a great improvement to the efficiency of parallel algorithm and expandability.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
