Skip to main content

Conclusions

  • Chapter
  • First Online:
  • 691 Accesses

Part of the book series: Big Data Management ((BIGDM))

Abstract

Large-scale graph analysis is a critical task for big data applications. The distributed graph computing system is a successful paradigm for the large-scale graph analysis. It not only helps analysts achieve high scalability and efficiency, but also enables analysts to focus on the logic of analysis tasks through transparenting the tedious distributed communication protocols. In this book, we chose Pregel-like systems as a basic platform, and studied the deficiency of existing systems.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Thomas N. Kipf and Max Welling. Semi-supervised classification with graph convolutional networks. In 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24–26, 2017, Conference Track Proceedings, 2017.

    Google Scholar 

  2. Yingxia Shao, Bin Cui, Lei Chen, Mingming Liu, and Xing Xie. An efficient similarity search framework for SimRank over large dynamic graphs. Proc. VLDB Endow., 8(8):838–849, April 2015.

    Article  Google Scholar 

  3. Yangzihao Wang, Andrew Davidson, Yuechao Pan, Yuduo Wu, Andy Riffel, and John D. Owens. Gunrock: A high-performance graph processing library on the gpu. In Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP ’16, pages 11:1–11:12, New York, NY, USA, 2016. ACM.

    Google Scholar 

  4. Zhipeng Zhang, Yingxia Shao, Bin Cui, and Ce Zhang. An experimental evaluation of SimRank-based similarity search algorithms. Proc. VLDB Endow., 10(5):601–612, January 2017.

    Article  Google Scholar 

  5. Shijie Zhou, Rajgopal Kannan, Hanqing Zeng, and Viktor K. Prasanna. An FPGA framework for edge-centric graph processing. In Proceedings of the 15th ACM International Conference on Computing Frontiers, CF ’18, pages 69–77, New York, NY, USA, 2018. ACM.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Shao, Y., Cui, B., Chen, L. (2020). Conclusions. In: Large-scale Graph Analysis: System, Algorithm and Optimization. Big Data Management. Springer, Singapore. https://doi.org/10.1007/978-981-15-3928-2_7

Download citation

  • DOI: https://doi.org/10.1007/978-981-15-3928-2_7

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-15-3927-5

  • Online ISBN: 978-981-15-3928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics