Multi-Hop Neighbor Query on Distributed Graphs

This project aims to design algorithms to query multi-hop neighbors on distributed graphs.

Project Details

• Algorithms:
  • Multi-hop neighbor query algorithm
• Environment:
  • Memory: 40 * 50G
  • CPU Cores: 40 * 7
  • Platform: Spark 2.2.0 + JDK 1.8
• Data Set:
  • twitter-2010
  • 40M nodes
  • 1.4B edges
• Performance:
  • 6 ~ 14 times faster than Spark SQL.

People

Zijian Li

Xiaofei Zhang

Wenjie Liu

Associate Professor