<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Graph computing on Apache HugeGraph</title><link>https://hugegraph.apache.org/versions/1.0/docs/quickstart/computing/</link><description>Recent content in Graph computing on Apache HugeGraph</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Mon, 01 Jan 0001 00:00:00 +0000</lastBuildDate><atom:link href="https://hugegraph.apache.org/versions/1.0/docs/quickstart/computing/index.xml" rel="self" type="application/rss+xml"/><item><title>HugeGraph-Computer Quick Start</title><link>https://hugegraph.apache.org/versions/1.0/docs/quickstart/computing/hugegraph-computer/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><guid>https://hugegraph.apache.org/versions/1.0/docs/quickstart/computing/hugegraph-computer/</guid><description>&lt;h2 id="1-hugegraph-computer-overview"&gt;1 HugeGraph-Computer Overview&#10;&lt;/h2&gt;&#10;&lt;p&gt;The &lt;a href="https://github.com/apache/incubator-hugegraph-computer"&gt;&lt;code&gt;HugeGraph-Computer&lt;/code&gt;&lt;/a&gt; is a distributed graph processing system for HugeGraph (OLAP). It is an implementation of &lt;a href="https://kowshik.github.io/JPregel/pregel_paper.pdf"&gt;Pregel&lt;/a&gt;. It runs on Kubernetes framework.&lt;/p&gt;&#10;&lt;h3 id="features"&gt;Features&#10;&lt;/h3&gt;&#10;&lt;ul&gt;&#10;&lt;li&gt;Support distributed MPP graph computing, and integrates with HugeGraph as graph input/output storage.&lt;/li&gt;&#10;&lt;li&gt;Based on BSP(Bulk Synchronous Parallel) model, an algorithm performs computing through multiple parallel iterations, every iteration is a superstep.&lt;/li&gt;&#10;&lt;li&gt;Auto memory management. The framework will never be OOM(Out of Memory) since it will split some data to disk if it doesn&amp;rsquo;t have enough memory to hold all the data.&lt;/li&gt;&#10;&lt;li&gt;The part of edges or the messages of super node can be in memory, so you will never lose it.&lt;/li&gt;&#10;&lt;li&gt;You can load the data from HDFS or HugeGraph, or any other system.&lt;/li&gt;&#10;&lt;li&gt;You can output the results to HDFS or HugeGraph, or any other system.&lt;/li&gt;&#10;&lt;li&gt;Easy to develop a new algorithm. You just need to focus on a vertex only processing just like as in a single server, without worrying about message transfer and memory/storage management.&lt;/li&gt;&#10;&lt;/ul&gt;&#10;&lt;h2 id="2-get-started"&gt;2 Get Started&#10;&lt;/h2&gt;&#10;&lt;h3 id="21-run-pagerank-algorithm-locally"&gt;2.1 Run PageRank algorithm locally&#10;&lt;/h3&gt;&#10;&lt;blockquote&gt;&#10;&lt;p&gt;To run algorithm with HugeGraph-Computer, you need to install 64-bit JRE/JDK 11 or later versions.&lt;/p&gt;</description></item></channel></rss>