From 4a1ad5bf6163b58c92901169455ba5469f9c121f Mon Sep 17 00:00:00 2001 From: Jingbo Xu Date: Wed, 31 Jul 2024 15:35:55 +0800 Subject: [PATCH] fix(docs): change images relative url to absolute url. (#568) --- docs/overview/overview.md | 2 +- docs/specification/format.md | 12 ++++++------ 2 files changed, 7 insertions(+), 7 deletions(-) diff --git a/docs/overview/overview.md b/docs/overview/overview.md index eebe4c23c..637278ba2 100644 --- a/docs/overview/overview.md +++ b/docs/overview/overview.md @@ -4,7 +4,7 @@ title: Overview sidebar_position: 1 --- -overview +overview GraphAr is a project to standardize the graph data format and provide a set of libraries to generate, access and transform such formatted files. diff --git a/docs/specification/format.md b/docs/specification/format.md index 110cca8ed..b456227f3 100644 --- a/docs/specification/format.md +++ b/docs/specification/format.md @@ -27,7 +27,7 @@ Each edge contains a unique identifier and: The following is an example property graph containing two types of vertices ("person" and "comment") and three types of edges. -property graph +property graph ## Property Data Types @@ -94,7 +94,7 @@ Each type of vertices (with the same label) constructs a logical vertex table, w Given an internal vertex id and the vertex label, a vertex is uniquely identifiable and its respective properties can be accessed from this table. The internal vertex id is further used to identify the source and destination vertices when maintaining the topology of the graph. -vertex logical table +vertex logical table :::note @@ -108,7 +108,7 @@ The logical vertex table will be partitioned into multiple continuous vertex chu Take the "person" vertex table as an example, if the chunk size is set to be 500, the logical table will be separated into sub-logical-tables of 500 rows with the exception of the last one, which may have less than 500 rows. The columns for maintaining properties will also be divided into distinct groups (e.g., 2 for our example). As a result, a total of 4 physical vertex tables are created for storing the example logical table, which can be seen from the following figure. -vertex physical table +vertex physical table :::note @@ -124,7 +124,7 @@ For maintaining a type of edges (that with the same triplet of the source label, Take the logical table for "person likes person" edges as an example, the logical edge table looks like: -edge logical table +edge logical table ### Physical table of edges @@ -139,9 +139,9 @@ Additionally, there would be an offset table for **ordered_by_source** or **orde Take the "person knows person" edges to illustrate. Suppose the vertex chunk size is set to 500 and the edge chunk size is 1024, and the edges are **ordered_by_source**, then the edges could be saved in the following physical tables: -edge physical table1 +edge physical table1 -edge physical table2 +edge physical table2 > **Tip:** When the edge type is **ordered_by_source**, the sorted adjList table together with the offset table can be used as CSR, supporting the fast access of the outgoing edges for a given vertex. Similarly, a CSC view can be constructed by sorting the edges by destination and recording corresponding offsets, supporting the fast access of the incoming edges for a given vertex.