Skip to content

Commit 825c8bb

Browse files
committed
Add edits
1 parent 7a3d36d commit 825c8bb

File tree

1 file changed

+4
-4
lines changed

1 file changed

+4
-4
lines changed

articles/cosmos-db/gremlin/modeling.md

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@ ms.author: mansha
1313
# Graph data modeling with Azure Cosmos DB for Apache Gremlin
1414
[!INCLUDE[Gremlin](../includes/appliesto-gremlin.md)]
1515

16-
This article provides recommendations for graph data models. These best practices are vital for ensuring the scalability and performance of a graph database system as the data evolves. An efficient data model is especially important for large-scale graphs.
16+
This article provides recommendations for the use of graph data models. These best practices are vital for ensuring the scalability and performance of a graph database system as the data evolves. An efficient data model is especially important for large-scale graphs.
1717

1818
## Requirements
1919

@@ -25,7 +25,7 @@ The process outlined in this guide is based on the following assumptions:
2525

2626
## When do I need a graph database?
2727

28-
A graph database solution can be optimally applied if the entities and relationships in a data domain have any of the following characteristics:
28+
A graph database solution can be optimally used if the entities and relationships in a data domain have any of the following characteristics:
2929

3030
* The entities are *highly connected* through descriptive relationships. The benefit in this scenario is that the relationships persist in storage.
3131
* There are *cyclic relationships* or *self-referenced entities*. This pattern is often a challenge when you use relational or document databases.
@@ -71,11 +71,11 @@ One common pitfall is to map properties of a single entity as separate vertices.
7171

7272
* **Vertex-based properties**: In this approach, the entity uses three separate vertices and two edges to describe its properties. While this approach might reduce redundancy, it increases model complexity. An increase in model complexity can result in added latency, query complexity, and computation cost. This model can also present challenges in partitioning.
7373

74-
:::image type="content" source="./media/modeling/graph-modeling-1.png" alt-text="Diagram of entity model with vertices for properties.":::
74+
:::image type="content" source="./media/modeling/graph-modeling-1.png" alt-text="Diagram of entity model with vertices for properties.":::
7575

7676
* **Property-embedded vertices**: This approach takes advantage of the key-value pair list to represent all the properties of the entity inside a vertex. This approach reduces model complexity, which leads to simpler queries and more cost-efficient traversals.
7777

78-
:::image type="content" source="./media/modeling/graph-modeling-2.png" alt-text="Diagram of the Luis vertex from the previous diagram with ID, label, and properties.":::
78+
:::image type="content" source="./media/modeling/graph-modeling-2.png" alt-text="Diagram of the Luis vertex from the previous diagram with ID, label, and properties.":::
7979

8080
> [!NOTE]
8181
> The preceding diagrams show a simplified graph model that only compares the two ways of dividing entity properties.

0 commit comments

Comments
 (0)