Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content

Phoenix: A Scalable Streaming Hypergraph Analysis Framework

  • Conference paper
  • First Online:
Advances in Data Science and Information Engineering

Abstract

We present Phoenix, a scalable hypergraph analytics framework for data analytics and knowledge discovery that was implemented on the leadership class computing platforms at Oak Ridge National Laboratory (ORNL). Our software framework comprises a distributed implementation of a streaming server architecture which acts as a gateway for various hypergraph generators/external sources to connect. Phoenix has the capability to utilize diverse hypergraph generators, including HyGen, a very large-scale hypergraph generator developed by ORNL. Phoenix incorporates specific algorithms for efficient data representation by exploiting hidden structures of the hypergraphs. Our experimental results demonstrate Phoenix’s scalable and stable performance on massively parallel computing platforms. Phoenix’s superior performance is due to the merging of high-performance computing with data analytic.

This manuscript has been authored in part by UT-Battelle, LLC, under contract no. DE-AC05-00OR22725 with the US Department of Energy (DOE). The US government retains and the publisher, by accepting the article for publication, acknowledges that the US government retains a nonexclusive, paid-up, irrevocable, worldwide license to publish or reproduce the published form of this manuscript, or allow others to do so, for US government purposes. DOE will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan).

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.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

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://www.top500.org/system/177975.

  2. 2.

    https://www.top500.org/system/179397.

References

  1. S. Agarwal, K. Branson, S. Belongie, Higher order learning with graphs, in Proceedings of the 23rd international conference on Machine learning (2006), pp. 17–24

    Google Scholar 

  2. A. Antelmi et al., SimpleHypergraphs.jl–novel software framework for modelling and analysis of hypergraphs, in International Workshop on Algorithms and Models for the Web-Graph (Springer, Cham, 2019), pp. 115–129

    Google Scholar 

  3. BalancedGo (2020). https://github.com/cem-okulmus/BalancedGo. Online. Accessed 03 Apr 2020

  4. Chapel Hypergraph Library (2020). https://github.com/pnnl/chgl. Online. Accessed 03 Apr 2020

  5. D. Ediger et al., STINGER: High performance data structure for streaming graphs, in 2012 IEEE Conference on High Performance Extreme Computing (2012), pp. 1–5

    Google Scholar 

  6. E. Estrada, J. Rodriguez-Velazquez, Complex networks as hypergraphs (2005) . Arxiv preprint physics 0505137

    Google Scholar 

  7. G. Feng, X. Meng, K. Ammar, DISTINGER: A distributed graph data structure for massive dynamic graph processing, in 2015 IEEE International Conference on Big Data (Big Data) (2015), pp. 1814–1822

    Google Scholar 

  8. Graph Signal Processing Toolbox (GSPBox) (2020). https://github.com/epfl-lts2/gspbox. Online. Accessed 03 Apr 2020

  9. B. Heintz, A. Chandra, Beyond graphs: toward scalable hypergraph analysis systems. SIGMETRICS Perform. Eval. Rev. 41(4), 94–97 (2014). ISSN: 0163-5999. https://doi.org/10.1145/2627534.2627563

    Article  Google Scholar 

  10. V. Hernandez, J.E. Roman, V. Vidal, SLEPc: A scalable and flexible toolkit for the solution of eigenvalue problems. ACM Trans. Math. Softw. (TOMS) 31(3), 351–362 (2005)

    Google Scholar 

  11. P. Hintjens, ZeroMQ: messaging for many applications (O’Reilly Media, Newton, 2013)

    Google Scholar 

  12. HyperGCN: A New Method of Training Graph Convolutional Networks on Hypergraphs (2020). https://github.com/malllabiisc/HyperGCN. Online. Accessed 03 Apr 2020

  13. Hypergraph Algorithms Package (2020). https://murali-group.github.io/halp/. Online. Accessed 03 Apr 2020

  14. HyperGraphLib (2020). https://github.com/alex87/HyperGraphLib. Online. Accessed 03 Apr 2020

  15. W. Jiang et al., HyperX: A scalable hypergraph framework. IEEE Trans. Knowl. Data Eng. 31(5), 909–922 (2019)

    Article  Google Scholar 

  16. KaHyPar - Karlsruhe Hypergraph Partitioning (2020). https://github.com/kahypar/kahypar. Online. Accessed 03 Apr 2020

  17. J. Leskovec et al., Kronecker graphs: An approach to modeling networks. J. Mach. Learn. Res. 11, 985–1042 (2010)

    MathSciNet  MATH  Google Scholar 

  18. A. Lugowski et al., Scalable complex graph analysis with the knowledge discovery toolbox, in 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (2012), pp. 5345–5348

    Google Scholar 

  19. multihypergraph (2020). https://github.com/vaibhavkarve/multihypergraph. Online. Accessed 03 Apr 2020

  20. networkR - An R package for analysing social and economic networks (2020). https://github.com/O1sims/networkR. Online. Accessed 03 Apr 2020

  21. pnnl/HyperNetX (2020). https://pnnl.github.io/HyperNetX/build/index.html. Online. Accessed 03 Apr 2020

  22. Pygraph (2020). https://github.com/jciskey/pygraph. Online. Accessed 03 Apr 2020

  23. RHEA: A conduit for large-scale scientific discovery by pre- and post- processing and analysis of simulation data. https://www.olcf.ornl.gov/olcf-resources/compute-systems/rhea/. Accessed 14 Apr 2020

  24. S. Schlag et al., K-way hypergraph partitioning via n-level recursive bisection, in 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (SIAM, Philadelphia, 2016), pp. 53–67

    Book  Google Scholar 

  25. P. Sen et al., Collective classification in network data. AI Mag.29(3), 93–93 (2008)

    Google Scholar 

  26. N. Sundaram et al., GraphMat: high performance graph analytics made productive. Proc. VLDB Endow. 8(11), 1214–1225 (2015). ISSN: 2150-8097. https://doi.org/10.14778/2809974.2809983

    Article  Google Scholar 

  27. J. Winick, S. Jamin, Inet-3.0: Internet topology generator. Technical Report CSE-TR-456-02, University of Michigan, 2002

    Google Scholar 

  28. M.M. Wolf, A.M. Klinvex, D.M. Dunlavy, Advantages to modeling relational data using hypergraphs versus graphs, in 2016 IEEE High Performance Extreme Computing Conference (HPEC) (2016), pp. 1–7

    Google Scholar 

  29. D.E. Womble et al., Early experiences on summit: data analytics and AI applications. IBM J. Res. Devel. 63(6), 2:1–2:9 (2019)

    Google Scholar 

  30. N. Yadati et al., HyperGCN: a new method for training graph convolutional networks on hypergraphs, in Advances in Neural Information Processing Systems (2019), pp. 1509–1520

    Google Scholar 

  31. A. Yoo, A.H. Baker, R. Pearce, A scalable eigensolver for large scale-free graphs using 2D graph partitioning, in Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis (2011), pp. 1–11

    Google Scholar 

  32. J. You et al., Graphrnn: Generating realistic graphs with deep autoregressive models (2018). Preprint. arXiv:1802.08773

    Google Scholar 

  33. D. Zhou, J. Huang, B. Schölkopf, Learning with hypergraphs: Clustering, classification, and embedding, in Advances in Neural Information Processing Systems (2007), pp. 1601–1608

    Google Scholar 

Download references

Acknowledgements

Support for this work was provided by the US Department of Defense. We used resources of the Computational Research and Development Programs and the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the US Department of Energy under contract no. DE-AC05-00OR22725.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kuldeep Kurte .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Kurte, K., Imam, N., Hasan, S.M.S., Kannan, R. (2021). Phoenix: A Scalable Streaming Hypergraph Analysis Framework. In: Stahlbock, R., Weiss, G.M., Abou-Nasr, M., Yang, CY., Arabnia, H.R., Deligiannidis, L. (eds) Advances in Data Science and Information Engineering. Transactions on Computational Science and Computational Intelligence. Springer, Cham. https://doi.org/10.1007/978-3-030-71704-9_1

Download citation

Publish with us

Policies and ethics