hypergraphs in chaos
play

Hypergraphs in Chaos JULIUS LISCHEID Graphs and Hypergraphs - PowerPoint PPT Presentation

Hypergraphs in Chaos JULIUS LISCHEID Graphs and Hypergraphs Hypergraphs (, ) are generalised graphs where hyperedges e E contain an arbitrary number of v 1 vertices v v 2 In short, E ()


  1. Hypergraphs in Chaos JULIUS LISCHEID

  2. Graphs and Hypergraphs • Hypergraphs ℋ(𝑊, 𝐹) are generalised graphs where hyperedges e ∈ E contain an arbitrary number of v 1 vertices v ∈ 𝑊 v 2 • In short, E ⊆ 𝒬(𝑊) • Applications in recommender systems, image retrieval, data profiling, bioinformatics etc. v 3 v 4 v 5 v 6

  3. Graphs and Hypergraphs • Hypergraphs can be represented as bipartite graphs v 1 • MESH [4], the currently fastest v 2 distributed framework, builds on GraphX that builds on Spark that builds on JVM v 3 MESH (Hypergraph API) v 4 GraphX (Graph API) v 5 Spark (RDD API) JVM v 6

  4. Distributed (Hyper)Graph Processing Genealogy < slower ≤ slower or equal HyperX ≤ ≤ (Spark on JVM) [5] (Spark on JVM) [3] PowerGraph (GraphX on Spark (C++) [2] on JVM) [4] ? (JVM) [1] (C++) [6]

  5. PowerGraph vs. GraphX (Spark on JVM) [3] ? PowerGraph ≤ (C++) [2] “ [ … ] for graph algorithms, GraphX is over an order of magnitude faster than the base dataflow system [i.e. Spark] and is comparable to or faster than specialized graph processing systems [i.e. PowerGraph]. ” Gonzalez et al., GraphX: Graph Processing in a Distributed Dataflow Framework [3] [7]

  6. Project Study vs. (C++) [6] (GraphX on Spark on JVM) [4] • Implement hypergraph PageRank algorithm in Chaos • Benchmark it against MESH

  7. Status Quo

  8. v 1 v 1 v 2 v 2 Questions? v 3 v 3 v 4 v 4 v 5 v 5 v 6 v 6 HyperX ≤ ≤ (Spark on JVM) (Spark on JVM) PowerGraph (GraphX on Spark (C++) on JVM) ? (JVM) (C++)

  9. References [1] Apache Giraph. https://giraph.apache.org/ [2] Gonzalez, Joseph E., et al. "Powergraph: Distributed graph-parallel computation on natural graphs." Presented as part of the 10th USENIX Symposium on Operating Systems Design and Implementation (OSDI 12) . 2012. [3] Gonzalez, Joseph E., et al. "Graphx: Graph processing in a distributed dataflow framework." 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14) . 2014. [4] Heintz, Benjamin, et al. "Mesh: A flexible distributed hypergraph processing system." arXiv preprint arXiv:1904.00549 (2019). [5] Jiang, Wenkai, et al. "HyperX: A Scalable Hypergraph Framework." IEEE Transactions on Knowledge and Data Engineering 31.5 (2018): 909-922. [6] Roy, Amitabha, et al. "Chaos: Scale-out graph processing from secondary storage." Proceedings of the 25th Symposium on Operating Systems Principles . ACM, 2015. [7] Zhu, Xiaowei, et al. "Gemini: A computation-centric distributed graph processing system." 12th USENIX Symposium on Operating Systems Design and Implementation (OSDI 16) . 2016.

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend