Difference between revisions of "NSGI-LD"
| Line 7: | Line 7: | ||
Basically this is all just a workaround for a missing separation of concerns in which not individual nodes are the core concept but subgraphs of a reasonable size that have a semantic meaning. | Basically this is all just a workaround for a missing separation of concerns in which not individual nodes are the core concept but subgraphs of a reasonable size that have a semantic meaning. | ||
| + | |||
| + | The main issues are reification blank nodes, IRI dereferencing and white box schema i would argue that in real life IRI dereferencing has a cost in terms of latency. In modern networks and software architecture it is much easier to assign IRIs to complete semantic subgraphs and link those. This also allows for subgraphs to be implemented in diverse technologies instead of forcing RDF implementation on everybody. | ||
Latest revision as of 09:25, 9 July 2025
see https://www.etsi.org/deliver/etsi_gs/CIM/001_099/006/01.02.01_60/gs_CIM006v010201p.pdf
Note how 5.2 Reification with blank nodes is immediately diving into the technical uglity of Blank nodes. With the definition In RDF, a blank node (also called bnode) is a node in an RDF graph representing a resource for which a URI or literal is not given.
Basically this is all just a workaround for a missing separation of concerns in which not individual nodes are the core concept but subgraphs of a reasonable size that have a semantic meaning.
The main issues are reification blank nodes, IRI dereferencing and white box schema i would argue that in real life IRI dereferencing has a cost in terms of latency. In modern networks and software architecture it is much easier to assign IRIs to complete semantic subgraphs and link those. This also allows for subgraphs to be implemented in diverse technologies instead of forcing RDF implementation on everybody.