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}
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.