https://www.solosoft.dev/tags/shared-nothing/Recent content in Shared-Nothing on SoloSoftHugoen-usFri, 01 May 2026 00:00:00 +0000https://www.solosoft.dev/post/nebula-graph-2026/Fri, 01 May 2026 00:00:00 +0000https://www.solosoft.dev/post/nebula-graph-2026/<p>Graph databases are essential for applications that need to traverse complex relationships at scale. NebulaGraph, developed by vesoft-inc, is a distributed graph database designed from the ground up for handling trillion-edge datasets with millisecond query latency.</p> <p>Unlike graph databases that bolt distribution onto a single-node design, NebulaGraph was built with a shared-nothing architecture where every component is horizontally scalable. Storage, computation, and metadata are decoupled, allowing independent scaling. The result is a graph database that can grow from a laptop to a 100+ node cluster without architectural changes.</p> <h2 id="architecture-components">Architecture Components</h2> <table> <thead> <tr> <th>Component</th> <th>Function</th> <th>Scalability</th> </tr> </thead> <tbody> <tr> <td>Meta Service</td> <td>Cluster metadata, schema management</td> <td>Raft consensus</td> </tr> <tr> <td>Storage Service</td> <td>Data persistence with auto-sharding</td> <td>Linear horizontal</td> </tr> <tr> <td>Graph Service</td> <td>Query computation and execution</td> <td>Linear horizontal</td> </tr> <tr> <td>Monitor Service</td> <td>Cluster health and performance</td> <td>Centralized</td> </tr> </tbody> </table> <h2 id="query-processing-flow">Query Processing Flow</h2> <figure class="mermaid-wrapper not-prose" role="img" aria-label="Mermaid diagram"> <div class="mermaid-container"> <pre class="mermaid">flowchart LR A[Client Query&lt;br/&gt;nGQL] --&gt; B[Graph Service] B --&gt; C[Query Parser] C --&gt; D[Query Planner] D --&gt; E[Query Optimizer] E --&gt; F[Execution Plan] F --&gt; G[Storage Service 1] F --&gt; H[Storage Service 2] F --&gt; I[Storage Service N] G --&gt; J[Result Aggregation] H --&gt; J I --&gt; J J --&gt; K[Final Result]</pre> <script type="application/mermaid">flowchart LR A[Client Query<br/>nGQL] --> B[Graph Service] B --> C[Query Parser] C --> D[Query Planner] D --> E[Query Optimizer] E --> F[Execution Plan] F --> G[Storage Service 1] F --> H[Storage Service 2] F --> I[Storage Service N] G --> J[Result Aggregation] H --> J I --> J J --> K[Final Result]</script> </div> </figure><p>Queries enter via the Graph Service where they are parsed, planned, and optimized. The execution plan is distributed across Storage Service nodes, each returning partial results that are aggregated into the final result.</p>