An experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm
Distributed graph processing has gained popularity in recent years. Among var- ious graph processing models, the vertex-centric model is implemented in many graph processing systems. Many optimization techniques have been proposed and extensive empirical evaluation has been done for various systems....
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Final Year Project |
語言: | English |
出版: |
2018
|
主題: | |
在線閱讀: | http://hdl.handle.net/10356/73989 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
id |
sg-ntu-dr.10356-73989 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-739892023-03-03T20:24:39Z An experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm Liu, Siyuan Arjit Khan School of Computer Science and Engineering DRNTU::Engineering Distributed graph processing has gained popularity in recent years. Among var- ious graph processing models, the vertex-centric model is implemented in many graph processing systems. Many optimization techniques have been proposed and extensive empirical evaluation has been done for various systems. However, no previous work has evaluated the vertex-centric model itself. In this final year project, the expressivity and efficiency of the model itself are studied with con- crete graph problems and datasets. Experimental results demonstrate that the model has limited expressivity and suffers from inefficiency. Bachelor of Engineering (Computer Science) 2018-04-23T04:27:03Z 2018-04-23T04:27:03Z 2018 Final Year Project (FYP) http://hdl.handle.net/10356/73989 en Nanyang Technological University 36 p. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
DRNTU::Engineering |
spellingShingle |
DRNTU::Engineering Liu, Siyuan An experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm |
description |
Distributed graph processing has gained popularity in recent years. Among var- ious graph processing models, the vertex-centric model is implemented in many graph processing systems. Many optimization techniques have been proposed and extensive empirical evaluation has been done for various systems. However, no previous work has evaluated the vertex-centric model itself. In this final year project, the expressivity and efficiency of the model itself are studied with con- crete graph problems and datasets. Experimental results demonstrate that the model has limited expressivity and suffers from inefficiency. |
author2 |
Arjit Khan |
author_facet |
Arjit Khan Liu, Siyuan |
format |
Final Year Project |
author |
Liu, Siyuan |
author_sort |
Liu, Siyuan |
title |
An experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm |
title_short |
An experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm |
title_full |
An experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm |
title_fullStr |
An experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm |
title_full_unstemmed |
An experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm |
title_sort |
experimental evaluation on expressivity and efficiency of vertex-centric graph processing paradigm |
publishDate |
2018 |
url |
http://hdl.handle.net/10356/73989 |
_version_ |
1759856501577482240 |