HGraph:用于大规模图形处理的并行和分布式工具

W. Adoni, Nahhal Tarik, M. Krichen, Abdeltif El byed
{"title":"HGraph:用于大规模图形处理的并行和分布式工具","authors":"W. Adoni, Nahhal Tarik, M. Krichen, Abdeltif El byed","doi":"10.1109/CAIDA51941.2021.9425162","DOIUrl":null,"url":null,"abstract":"Graph are ubiquitous because the fields of application are varied. Well-known examples are social networks, biological networks and path-finding in road networks. Real-world graphs processing is very challenging because of 4V characteristics related to big data. They are huge to process them on single-node and the time complexity is exponential. Unfortunately, due to the lack of research, only a few systems are able to ensure the storage and quick processing of large-scale graphs. In this paper, we propose HGraph, a parallel and distributed tool which handles large-scale graphs. HGraph is build on top of Hadoop and Spark frameworks. The proposed tool provides high scalability and is adapted to easily implement algorithms for various graph problems. Experimental tests performed on real-world graphs showed that HGraph is reliable and achieves significant gain time over the state of the art of graph processing systems.","PeriodicalId":272573,"journal":{"name":"2021 1st International Conference on Artificial Intelligence and Data Analytics (CAIDA)","volume":"248 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"HGraph: Parallel and Distributed Tool for Large-Scale Graph Processing\",\"authors\":\"W. Adoni, Nahhal Tarik, M. Krichen, Abdeltif El byed\",\"doi\":\"10.1109/CAIDA51941.2021.9425162\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph are ubiquitous because the fields of application are varied. Well-known examples are social networks, biological networks and path-finding in road networks. Real-world graphs processing is very challenging because of 4V characteristics related to big data. They are huge to process them on single-node and the time complexity is exponential. Unfortunately, due to the lack of research, only a few systems are able to ensure the storage and quick processing of large-scale graphs. In this paper, we propose HGraph, a parallel and distributed tool which handles large-scale graphs. HGraph is build on top of Hadoop and Spark frameworks. The proposed tool provides high scalability and is adapted to easily implement algorithms for various graph problems. Experimental tests performed on real-world graphs showed that HGraph is reliable and achieves significant gain time over the state of the art of graph processing systems.\",\"PeriodicalId\":272573,\"journal\":{\"name\":\"2021 1st International Conference on Artificial Intelligence and Data Analytics (CAIDA)\",\"volume\":\"248 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 1st International Conference on Artificial Intelligence and Data Analytics (CAIDA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CAIDA51941.2021.9425162\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 1st International Conference on Artificial Intelligence and Data Analytics (CAIDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CAIDA51941.2021.9425162","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

由于应用领域的多样性,图形无处不在。众所周知的例子是社会网络、生物网络和道路网络中的寻路。由于与大数据相关的4V特性,现实世界的图形处理非常具有挑战性。在单节点上处理它们是巨大的,而且时间复杂度是指数级的。遗憾的是,由于缺乏研究,只有少数系统能够保证大规模图形的存储和快速处理。在本文中,我们提出了HGraph,一个并行和分布式的工具,用于处理大规模的图。HGraph是建立在Hadoop和Spark框架之上的。该工具具有较高的可扩展性,可以很容易地实现各种图问题的算法。在真实世界的图形上进行的实验测试表明,HGraph是可靠的,并且在图形处理系统的技术状态下实现了显著的增益时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
HGraph: Parallel and Distributed Tool for Large-Scale Graph Processing
Graph are ubiquitous because the fields of application are varied. Well-known examples are social networks, biological networks and path-finding in road networks. Real-world graphs processing is very challenging because of 4V characteristics related to big data. They are huge to process them on single-node and the time complexity is exponential. Unfortunately, due to the lack of research, only a few systems are able to ensure the storage and quick processing of large-scale graphs. In this paper, we propose HGraph, a parallel and distributed tool which handles large-scale graphs. HGraph is build on top of Hadoop and Spark frameworks. The proposed tool provides high scalability and is adapted to easily implement algorithms for various graph problems. Experimental tests performed on real-world graphs showed that HGraph is reliable and achieves significant gain time over the state of the art of graph processing systems.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信