Bipartite Graphs as Intermediate Model for RDF

11 years 10 months ago
Bipartite Graphs as Intermediate Model for RDF
Abstract. RDF Graphs are sets of assertions in the form of subjectpredicate-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 RDF Bipartite Graph its advantages as intermediate model between the abstract triple syntax and data structures used by applications. In the light of this model we explore the issues of transformation costs, data/schemastructure, and the notion of RDF connectivity.
Jonathan Hayes, Claudio Gutiérrez
Added 02 Jul 2010
Updated 02 Jul 2010
Type Conference
Year 2004
Authors Jonathan Hayes, Claudio Gutiérrez
Comments (0)