{"title":"改进了apache spark graphX中的最短路径查找算法","authors":"T. Phan, P. Do","doi":"10.1145/3184066.3184083","DOIUrl":null,"url":null,"abstract":"The shortest path finding problem is one of the most important and common problems on graphs. It is also a basic problem applied to solve other problems such as the betweenness centrality problem, the closeness centrality problem... Therefore, in all graph processing platforms, there is a way to solve this problem. Apache Spark GraphX is also. However, the shortest path finding algorithm in GraphX has some drawbacks to discuss more. Therefore, in this paper we analyze some issues in finding the shortest path in GraphX, then we propose two new algorithms to improve for better performance, and finally we compare the performance between the shortest path finding algorithm in GraphX and proposed algorithms.","PeriodicalId":109559,"journal":{"name":"International Conference on Machine Learning and Soft Computing","volume":"463 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Improving the shortest path finding algorithm in apache spark graphX\",\"authors\":\"T. Phan, P. Do\",\"doi\":\"10.1145/3184066.3184083\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The shortest path finding problem is one of the most important and common problems on graphs. It is also a basic problem applied to solve other problems such as the betweenness centrality problem, the closeness centrality problem... Therefore, in all graph processing platforms, there is a way to solve this problem. Apache Spark GraphX is also. However, the shortest path finding algorithm in GraphX has some drawbacks to discuss more. Therefore, in this paper we analyze some issues in finding the shortest path in GraphX, then we propose two new algorithms to improve for better performance, and finally we compare the performance between the shortest path finding algorithm in GraphX and proposed algorithms.\",\"PeriodicalId\":109559,\"journal\":{\"name\":\"International Conference on Machine Learning and Soft Computing\",\"volume\":\"463 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-02-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Machine Learning and Soft Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3184066.3184083\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Machine Learning and Soft Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3184066.3184083","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Improving the shortest path finding algorithm in apache spark graphX
The shortest path finding problem is one of the most important and common problems on graphs. It is also a basic problem applied to solve other problems such as the betweenness centrality problem, the closeness centrality problem... Therefore, in all graph processing platforms, there is a way to solve this problem. Apache Spark GraphX is also. However, the shortest path finding algorithm in GraphX has some drawbacks to discuss more. Therefore, in this paper we analyze some issues in finding the shortest path in GraphX, then we propose two new algorithms to improve for better performance, and finally we compare the performance between the shortest path finding algorithm in GraphX and proposed algorithms.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
