Skip to content

Commit 7dfbddb

Browse files
authored
File path updates for images (typedb#536)
Updates to wrong file paths and some minor errors.
1 parent beaacef commit 7dfbddb

File tree

2 files changed

+5
-5
lines changed

2 files changed

+5
-5
lines changed

12-comparisons/02-graph-databases-and-typedb.md

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -69,15 +69,15 @@ As relationships are directed, they always have a start and an end node. To give
6969
However, the graph model doesn't directly map to a conceptual model or ER diagram, as nodes and edges don't always directly map to entities and relationships. Graph databases also offer no native support for concepts such as, for example, ternary relations, n-ary relations or roles. Therefore, to implement a graph model, we must first go through a normalisation process and map our conceptual model (ER diagram) to the graph model.
7070

7171
![Graph Database Normalisation](../images/comparisons/graph-normalisation.png)
72-
*In a graph database we need to map our conceptual model the graph model.*
72+
*In a graph database we need to map our conceptual model to the graph model.*
7373

7474
### Concept Level Modelling
7575

7676
TypeDB provides a concept-level schema that fully implements the Entity-Relationship (ER) model. TypeDB's schema is a type system that implements the principles of knowledge representation and reasoning.
7777

7878
Unlike in a graph database, this means that we can map any ER Diagram directly to how we implement it in TypeQL, avoiding the need to go through a normalisation process. In TypeDB, we create a direct mapping of the ER Diagram with entities, relations, attributes and roles to how we implement it later in code. By modelling at the conceptual level using a type system, we avoid the need to go through a normalisation process that would otherwise be required in a graph database.
7979

80-
![TypeDB abstraction](../images/comparisons/typeql-abstraction-over-graph.png)
80+
![TypeDB abstraction](../images/comparisons/typedb-abstraction-over-graph.png)
8181
*TypeDB's type system is a direct implementation of a conceptual model.*
8282

8383

@@ -131,7 +131,7 @@ This is how we would create a `supplying` (intermediary) node that would connect
131131

132132
In TypeDB, instead of creating an intermediate node, we create one `supplying` relation that relates to the supplier, buyer and the part that's being supplied:
133133

134-
![TypeDB ternary example](../images/comparisons/typeql-ternary-example.png)
134+
![TypeDB ternary example](../images/comparisons/typedb-ternary-example.png)
135135

136136
<!-- test-ignore -->
137137
```typeql
@@ -172,7 +172,7 @@ In a graph database, we cannot create nested relations. Instead, we can model a
172172

173173
TypeDB's type system natively supports nested relations as modelling constructs. For the model above, we would create a relation `located` that connects the relation `marriage` with the `city` "London". This would look like this:
174174

175-
![TypeDB nested relation](../images/comparisons/typeql-nested-relation.png)
175+
![TypeDB nested relation](../images/comparisons/typedb-nested-relation.png)
176176

177177
<!-- test-ignore -->
178178
```typeql
@@ -633,7 +633,7 @@ when {
633633
(person-at-risk: $person, risked-disease: $disease, risked-disease: $disease2) isa alcohol-risk-factor;
634634
};
635635
636-
rule heriditary-risk-of-diabetes:
636+
rule hereditary-risk-of-diabetes:
637637
when {
638638
$person isa person;
639639
$parent isa person;
78.1 KB
Loading

0 commit comments

Comments
 (0)