Improving the shortest path finding algorithm in apache spark graphX

T. Phan, P. Do
{"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}
引用次数: 1

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.
改进了apache spark graphX中的最短路径查找算法
最短路径查找问题是图中最重要和最常见的问题之一。它也是解决中间中心性问题、接近中心性问题等问题的基本问题。因此,在所有的图形处理平台中,都有一种方法可以解决这个问题。Apache Spark GraphX也是。然而,GraphX中的最短路径查找算法有一些缺点需要进一步讨论。因此,本文分析了GraphX中寻找最短路径的一些问题,然后提出了两种新的算法进行改进以获得更好的性能,最后我们比较了GraphX中最短路径查找算法和所提算法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信