![]() RDF has a special nomenclature for naming nodes and edges in a graph. This simple, flexible data model has a lot of expressive power to represent complex situations, relationships, and other things of interest, while also being appropriately abstract, i.e., it does not expose very much implementation detail in the same way as, say, the relational data model used with SQL. The rdf:type edge represent a special kind of relationship that we will explain below, in the RDF Schema section. For example, the :member edge links bands to its members. Each edge has an identifier that tells us what relationship holds between those nodes. This graph shows several nodes that represent entities such as the Beatles band and one of their studio albums. Here’s a picture that shows an RDF graph about The Beatles: An edge points from one node to another node. So really the edges are directional or you can think of them as arrows, i.e., the edges aren’t really lines but they have a pointer like this: →. We will talk about the “semantic” part in an upcoming tutorial for now let’s talk about the “directed” part.Ī directed graph is a set of objects, usually just called “nodes”, connected together by lines, usually just called edges, that are “directed” from one node to another. More specifically, Stardog’s data model is a directed semantic graph. Stardog supports a graph data model based on RDF, a W3C standard for exchanging graph data. Learn about the RDF graph model used by Stardog Page Contents
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |