Network performance aware graph partitioning for large graph processing systems in the cloud

Rishan Chen, Xuetian Weng, Bingsheng He, Koon Kau CHOI, Mao Yang

Research output: Chapter in book/report/conference proceedingChapterpeer-review

1 Citation (Scopus)

Abstract

A wide variety of recent applications model their data in graphs/networks such as social networks, web graphs, and protein-protein interaction networks. Efficient processing for large graph data poses new challenges for almost all components of state-of-the-art data management systems. To list a few examples: (i) graph data are complex structures and cannot be efficiently stored as relational tables; (ii) the access patterns of large graph processing are complex, which results in inefficient disk accesses or network communications; and (iii) last but not least, to tackle scalability issues, graph processing must be efficiently distributed in a networked environment.

Original languageEnglish
Title of host publicationLarge Scale and Big Data
Subtitle of host publicationProcessing and Management
PublisherCRC Press
Pages229-254
Number of pages26
ISBN (Electronic)9781466581517
ISBN (Print)9781466581500
DOIs
Publication statusPublished - 2014

Scopus Subject Areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Network performance aware graph partitioning for large graph processing systems in the cloud'. Together they form a unique fingerprint.

Cite this