Improving large graph processing on partitioned graphs in the cloud
As the study of large graphs over hundreds of gigabytes becomes increasingly popular for various data-intensive applications in cloud computing, developing large graph processing systems has become a hot and fruitful research area. Many of those existing systems support a vertex-oriented execution m...
Saved in:
Main Authors: | Chen, Rishan, Yang, Mao, Weng, Xuetian, Choi, Byron, He, Bingsheng, Li, Xiaoming |
---|---|
Other Authors: | School of Computer Engineering |
Format: | Conference or Workshop Item |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/99469 http://hdl.handle.net/10220/12588 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
Similar Items
-
FLAG: towards graph query autocompletion for large graphs
by: Yi, Peipei, et al.
Published: (2023) -
GPU-accelerated subgraph enumeration on partitioned graphs
by: GUO, Wentian, et al.
Published: (2020) -
Cache-efficient fork-processing patterns on large graphs
by: LU, Shengliang, et al.
Published: (2021) -
Medusa : a parallel graph processing system on graphics processors
by: He, Bingsheng, et al.
Published: (2019) -
Cycle partitions in graphs
by: Chen, C.C., et al.
Published: (2014)