How to partition a billion-node graph

@article{Wang2014HowTP,
  title={How to partition a billion-node graph},
  author={Lu Wang and Yanghua Xiao and Bin Shao and Haixun Wang},
  journal={2014 IEEE 30th International Conference on Data Engineering},
  year={2014},
  pages={568-579}
}
Billion-node graphs pose significant challenges at all levels from storage infrastructures to programming models. It is critical to develop a general purpose platform for graph processing. A distributed memory system is considered a feasible platform supporting online query processing as well as offline graph analytics. In this paper, we study the problem of partitioning a billion-node graph on such a platform, an important consideration because it has direct impact on load balancing and… CONTINUE READING
Highly Cited
This paper has 79 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 52 extracted citations

80 Citations

0102020142015201620172018
Citations per Year
Semantic Scholar estimates that this publication has 80 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 29 references

An efficient heuristic procedure for partitioning graphs

  • B. Kernighan
  • Bell Systems Journal, vol. 49, pp. 291–307, 1972.
  • 1972
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…