Big graph processing systems

State-of-the-art and open challenges

Radwa Elshawi, Omar Batarfi, Ayman Fayoumi, Ahmed Barnawi, Sherif Sakr

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

5 Citations (Scopus)

Abstract

Graph is a fundamental data structure that captures relationships between different data entities. In practice, graphs are widely used for modeling complicated data in different application domains such as social networks, protein networks, transportation networks, bibliographical networks, knowledge bases and many more. Currently, graphs with millions and billions of nodes and edges have become very common. In principle, graph analytics is an important big data discovery technique. Therefore, with the increasing abundance of large graphs, designing scalable systems for processing and analyzing large scale graphs has become one of the most timely problems facing the big data research community. In general, distributed processing of big graphs is a challenging task due to their size and the inherent irregular structure of graph computations. Thus, in recent years, we have witnessed an unprecedented interest in building big graph processing systems that attempted to tackle these challenges. To better understand the challenges of developing scalable graph processing systems, in this paper, we provide a comprehensive overview of the state-of-the art. In addition, we identify a set of the current open research challenges and discuss some promising directions for future research.

Original languageEnglish
Title of host publicationProceedings - 2015 IEEE 1st International Conference on Big Data Computing Service and Applications, BigDataService 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages24-33
Number of pages10
ISBN (Electronic)9781479981281
DOIs
Publication statusPublished - 10 Aug 2015
Event1st IEEE International Conference on Big Data Computing Service and Applications, BigDataService 2015 - San Francisco, United States
Duration: 30 Mar 20153 Apr 2015

Other

Other1st IEEE International Conference on Big Data Computing Service and Applications, BigDataService 2015
CountryUnited States
CitySan Francisco
Period30/03/153/04/15

Fingerprint

Processing
Data structures
Proteins
Big data

Keywords

  • Big Data
  • Big Graph
  • Graph Processing

Cite this

Elshawi, R., Batarfi, O., Fayoumi, A., Barnawi, A., & Sakr, S. (2015). Big graph processing systems: State-of-the-art and open challenges. In Proceedings - 2015 IEEE 1st International Conference on Big Data Computing Service and Applications, BigDataService 2015 (pp. 24-33). [7184861] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/BigDataService.2015.11
Elshawi, Radwa ; Batarfi, Omar ; Fayoumi, Ayman ; Barnawi, Ahmed ; Sakr, Sherif. / Big graph processing systems : State-of-the-art and open challenges. Proceedings - 2015 IEEE 1st International Conference on Big Data Computing Service and Applications, BigDataService 2015. Institute of Electrical and Electronics Engineers Inc., 2015. pp. 24-33
@inproceedings{b8e73598320848df851ae266cb68a35a,
title = "Big graph processing systems: State-of-the-art and open challenges",
abstract = "Graph is a fundamental data structure that captures relationships between different data entities. In practice, graphs are widely used for modeling complicated data in different application domains such as social networks, protein networks, transportation networks, bibliographical networks, knowledge bases and many more. Currently, graphs with millions and billions of nodes and edges have become very common. In principle, graph analytics is an important big data discovery technique. Therefore, with the increasing abundance of large graphs, designing scalable systems for processing and analyzing large scale graphs has become one of the most timely problems facing the big data research community. In general, distributed processing of big graphs is a challenging task due to their size and the inherent irregular structure of graph computations. Thus, in recent years, we have witnessed an unprecedented interest in building big graph processing systems that attempted to tackle these challenges. To better understand the challenges of developing scalable graph processing systems, in this paper, we provide a comprehensive overview of the state-of-the art. In addition, we identify a set of the current open research challenges and discuss some promising directions for future research.",
keywords = "Big Data, Big Graph, Graph Processing",
author = "Radwa Elshawi and Omar Batarfi and Ayman Fayoumi and Ahmed Barnawi and Sherif Sakr",
year = "2015",
month = "8",
day = "10",
doi = "10.1109/BigDataService.2015.11",
language = "English",
pages = "24--33",
booktitle = "Proceedings - 2015 IEEE 1st International Conference on Big Data Computing Service and Applications, BigDataService 2015",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
address = "United States",

}

Elshawi, R, Batarfi, O, Fayoumi, A, Barnawi, A & Sakr, S 2015, Big graph processing systems: State-of-the-art and open challenges. in Proceedings - 2015 IEEE 1st International Conference on Big Data Computing Service and Applications, BigDataService 2015., 7184861, Institute of Electrical and Electronics Engineers Inc., pp. 24-33, 1st IEEE International Conference on Big Data Computing Service and Applications, BigDataService 2015, San Francisco, United States, 30/03/15. https://doi.org/10.1109/BigDataService.2015.11

Big graph processing systems : State-of-the-art and open challenges. / Elshawi, Radwa; Batarfi, Omar; Fayoumi, Ayman; Barnawi, Ahmed; Sakr, Sherif.

Proceedings - 2015 IEEE 1st International Conference on Big Data Computing Service and Applications, BigDataService 2015. Institute of Electrical and Electronics Engineers Inc., 2015. p. 24-33 7184861.

Research output: Chapter in Book/Report/Conference proceedingConference contributionResearchpeer-review

TY - GEN

T1 - Big graph processing systems

T2 - State-of-the-art and open challenges

AU - Elshawi, Radwa

AU - Batarfi, Omar

AU - Fayoumi, Ayman

AU - Barnawi, Ahmed

AU - Sakr, Sherif

PY - 2015/8/10

Y1 - 2015/8/10

N2 - Graph is a fundamental data structure that captures relationships between different data entities. In practice, graphs are widely used for modeling complicated data in different application domains such as social networks, protein networks, transportation networks, bibliographical networks, knowledge bases and many more. Currently, graphs with millions and billions of nodes and edges have become very common. In principle, graph analytics is an important big data discovery technique. Therefore, with the increasing abundance of large graphs, designing scalable systems for processing and analyzing large scale graphs has become one of the most timely problems facing the big data research community. In general, distributed processing of big graphs is a challenging task due to their size and the inherent irregular structure of graph computations. Thus, in recent years, we have witnessed an unprecedented interest in building big graph processing systems that attempted to tackle these challenges. To better understand the challenges of developing scalable graph processing systems, in this paper, we provide a comprehensive overview of the state-of-the art. In addition, we identify a set of the current open research challenges and discuss some promising directions for future research.

AB - Graph is a fundamental data structure that captures relationships between different data entities. In practice, graphs are widely used for modeling complicated data in different application domains such as social networks, protein networks, transportation networks, bibliographical networks, knowledge bases and many more. Currently, graphs with millions and billions of nodes and edges have become very common. In principle, graph analytics is an important big data discovery technique. Therefore, with the increasing abundance of large graphs, designing scalable systems for processing and analyzing large scale graphs has become one of the most timely problems facing the big data research community. In general, distributed processing of big graphs is a challenging task due to their size and the inherent irregular structure of graph computations. Thus, in recent years, we have witnessed an unprecedented interest in building big graph processing systems that attempted to tackle these challenges. To better understand the challenges of developing scalable graph processing systems, in this paper, we provide a comprehensive overview of the state-of-the art. In addition, we identify a set of the current open research challenges and discuss some promising directions for future research.

KW - Big Data

KW - Big Graph

KW - Graph Processing

UR - http://www.scopus.com/inward/record.url?scp=84959476149&partnerID=8YFLogxK

U2 - 10.1109/BigDataService.2015.11

DO - 10.1109/BigDataService.2015.11

M3 - Conference contribution

SP - 24

EP - 33

BT - Proceedings - 2015 IEEE 1st International Conference on Big Data Computing Service and Applications, BigDataService 2015

PB - Institute of Electrical and Electronics Engineers Inc.

ER -

Elshawi R, Batarfi O, Fayoumi A, Barnawi A, Sakr S. Big graph processing systems: State-of-the-art and open challenges. In Proceedings - 2015 IEEE 1st International Conference on Big Data Computing Service and Applications, BigDataService 2015. Institute of Electrical and Electronics Engineers Inc. 2015. p. 24-33. 7184861 https://doi.org/10.1109/BigDataService.2015.11