The visualization above tells us that the visualizations of DART (the data-relational object) and the graphical visualization of DART (the data-relational data model) are the same. Both give us our information but for different reasons.

An object has DART if and only if it has an object property or function.

If we need to be able to refer to objects in a graph we should provide both a DART property and an object property, just like in DART.

Now, let’s look at some visualizations of DART and some graphical representations of DART.

Zooming out to see the structure of the data in DART

DART provides a powerful means of visualizing data relationships, as illustrated in the above graphic, and it is also great for creating datasets that can be visualized by other technologies, such as Python.

In the previous section we saw how the visualizations of DART were conceptually similar to Dijkstra’s graphs. These visualizations are similar in that both provide a way to relate relationships between data objects in a graph.

However, DART is a graph database, whereas Dijkstra’s graphs are not. DART is a data-relational database that supports transactions (relational data). Dijkstra’s graphs are not.

Dijkstra’s graphs are more complicated than DART’s because they are hierarchical and have a primary key/key/value structure. Dijkstra’s graphs have a different character from DART’s because they have nested data structures, instead of a primary key/key/value structure.

To make things clear, consider the following simple graph:

We can visualize the data on either the left or right side of the diagram. The data is represented in both the horizontal and vertical directions. However, if we only want to visualize the left side of the diagram, we would have to write the following code to get the data on the left:

In short, the graphs in DART are more complex than those in Dijkstra’s graphs because the data is represented on both the horizontal and vertical axes.

The next graphic, showing the data models of DART, is the same as the last one but this time with graphical representations of DART.

I recommend checking out this quick visualization of the data models of DART if you are interested in the full functionality of DART.

The two graphs, left and right, are similar to those in the previous section but they also have an important difference. The left graph has the primary key (called the user key) and the primary key/key/value (called the home key) data model, whereas the right graph has a completely different data model.