Skip to content

Commit

Permalink
pic error fix (#1289)
Browse files Browse the repository at this point in the history
  • Loading branch information
abby-cyber committed Apr 25, 2022
1 parent 1e02aff commit aab11e3
Show file tree
Hide file tree
Showing 2 changed files with 4 additions and 4 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -82,7 +82,7 @@ Graphs consist of vertices and edges. Nebula Graph uses key-value pairs to store

Different from Nebula Graph version 2.x, version 3.x added a new key for each vertex. Compared to the old key that still exists, the new key has no `TagID` field and no value. Vertices in Nebula Graph can now live without tags owing to the new key.

![The vertex structure of Nebula Graph](https://github.com/vesoft-inc/nebula-docs-cn/blob/{{nebula.branch}}/docs-2.0/1.introduction/3.nebula-graph-architecture/3.0-vertex-key.png?raw=true)
![The vertex structure of Nebula Graph](https://docs-cdn.nebula-graph.com.cn/figures/3.0-vertex-key.png)

|Field|Description|
|:---|:---|
Expand All @@ -94,7 +94,7 @@ Graphs consist of vertices and edges. Nebula Graph uses key-value pairs to store

- The storage structure of edges

![The edge structure of Nebula Graph](https://github.com/vesoft-inc/nebula-docs-cn/blob/{{nebula.branch}}/docs-2.0/1.introduction/3.nebula-graph-architecture/3.0-edge-key.png?raw=true)
![The edge structure of Nebula Graph](https://docs-cdn.nebula-graph.com.cn/figures/3.0-edge-key.png)

|Field|Description|
|:---|:---|
Expand Down Expand Up @@ -122,7 +122,7 @@ Since in an ultra-large-scale relational network, vertices can be as many as ten

In Nebula Graph, an edge corresponds to two key-value pairs on the hard disk. When there are lots of edges and each has many properties, storage amplification will be obvious. The storage format of edges is shown in the figure below.

![partitioning by edge](https://github.com/vesoft-inc/nebula-docs-cn/blob/{{nebula.branch}}/docs-2.0/1.introduction/3.nebula-graph-architecture/edge-division.png?raw=true)
![partitioning by edge](https://docs-cdn.nebula-graph.com.cn/figures/edge-division.png)

In this example, ScrVertex connects DstVertex via EdgeA, forming the path of `(SrcVertex)-[EdgeA]->(DstVertex)`. ScrVertex, DstVertex, and EdgeA will all be stored in Partition x and Partition y as four key-value pairs in the storage layer. Details are as follows:

Expand Down
Original file line number Diff line number Diff line change
Expand Up @@ -35,7 +35,7 @@ Before installing Studio, you need to install the following software and ensure

If you can see the **Config Server** page on the browser, Studio is started successfully.

![The Config Server page shows that Studio is started successfully](https://docs-cdn.nebula-graph.com.cn/figures/st-ug-025.png "Studio is started")
![The Config Server page shows that Studio is started successfully](https://docs-cdn.nebula-graph.com.cn/figures/st-ug-000-en.png "Studio is started")


## Uninstall
Expand Down

0 comments on commit aab11e3

Please sign in to comment.