November 2022
Intermediate to advanced
294 pages
5h 58m
English
The Dgraph data model is a little curious. Superficially, it resembles RDF in that nodes connect to both nodes and literal values via edges. But critically, it does away with RDF’s key feature—external IDs. This is the very feature that allows for web-scale data integration. As such, it corresponds to an RDF that uses blank nodes.
Dgraph’s Take on RDF | |
|---|---|
|
|
Dgraph uses an RDF-like N-Triples syntax for data mutations. (The documentation talks about N-Quads, although all the examples are in N-Triples format.) Note that this isn’t strictly RDF as properties are typically expressed using local names, whereas RDF requires properties to be ... |
Read now
Unlock full access