Bipartite Graphs as Intermediate Model for RDF by Jonathan Hayes and Claudio Gutierrez.
Abstract:
RDF Graphs are sets of assertions in the form of subject-predicate-object triples of information resources. Although for simple examples they can be understood intuitively as directed labeled graphs, this representation does not scale well for more complex cases, particularly regarding the central notion of connectivity of resources.
We argue in this paper that there is need for an intermediate representation of RDF to enable the application of well-established methods from Graph Theory. We introduce the concept of Bipartite Statement-Value Graph and show its advantages as intermediate model between the abstract triple syntax and data structures used by applications. In the light of this model we explore issues like transformation costs, data/schema structure, the notion of connectivity, and database mappings.
A quite different take on the representation of RDF than in Is That A Graph In Your Cray? Here we encounter hypergraphs for modeling RDF.
Suggestions on how to rank graph representations of RDF?
Or perhaps better, suggestion on how to rank graph representations for use cases?
Putting the question of what (connections/properties) we want to model before the question of how (RDF, etc.) we intend to model it.
Isn’t that the right order?
Comments?