The Community for Technology Leaders
RSS Icon
Subscribe
Honolulu, HI, USA USA
June 24, 2012 to June 29, 2012
ISBN: 978-1-4673-2892-0
pp: 455-462
ABSTRACT
We present an efficient distributed graph database architecture for large scale social computing. The architecture consists of a distributed graph data processing system and a distributed graph data storage system. We leverage the advantages of both systems to achieve efficient social computing. We conduct extensive experiments to demonstrate the performance of our system. We employ four real-world, large scale social networks ¡V YouTube, Flicker, LiveJournal and Orkut as test data. We also implement several representative social applications and graph algorithms to examine the performance of our system. We employ two main optimization techniques in our system ¡Vindexing and graph partitioning. Experimental results indicate that our system outperforms GoldenOrb, an implementation foreleg model from Google.
INDEX TERMS
Distributed databases, Data processing, YouTube, Servers, Computer architecture, cloud computing, graph database, social network, social computing
CITATION
Li-Yung Ho, Jan-Jan Wu, Pangfeng Liu, "Distributed Graph Database for Large-Scale Social Computing", CLOUD, 2012, 2013 IEEE Sixth International Conference on Cloud Computing, 2013 IEEE Sixth International Conference on Cloud Computing 2012, pp. 455-462, doi:10.1109/CLOUD.2012.33
45 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool