Using Map-Reduce for Large Scale Analysis of Graph-Based Data
As social networks have gained in popularity, maintaining and processing the social network graph information using graph algorithms has become an essential source for discovering potential features of the graph. The escalating size of the social networks has made it impossible to process the huge g...
Main Author: | Gong, Nan |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Skolan för informations- och kommunikationsteknik (ICT)
2011
|
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-102822 |
Similar Items
-
Exploiting and Evaluating MapReduce for Large-scale Graph Mining
by: Hung-Che Lai, et al.
Published: (2010) -
An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs
by: Alfredo Cuzzocrea, et al.
Published: (2016-01-01) -
Efficient Subgraph Matching on Large RDF Graphs Using MapReduce
by: Xin Wang, et al.
Published: (2019-04-01) -
Join Operations for Large-Scale Data on MapReduce Framework
by: Zhi-Hong Chang, et al.
Published: (2012) -
Label Propagation-Based Parallel Graph Partitioning for Large-Scale Graph Data
by: Minho Bae, et al.
Published: (2020-01-01)