• search hit 349 of 354
Back to Result List

Networked RDF graphs

  • Networked graphs are defined in this paper as a small syntactic extension of named graphs in RDF. They allow for the definition of a graph by explicitly listing triples as well as by SPARQL queries on one or multiple other graphs. By this extension it becomes possible to define a graph including a view onto other graphs and to define the meaning of a set of graphs by the way they reference each other. The semantics of networked graphs is defined by their mapping into logic programs. The expressiveness and computational complexity of networked graphs, varying by the set of constraints imposed on the underlying SPARQL queries, is investigated. We demonstrate the capabilities of networked graphs by a simple use case.

Download full text files

Export metadata

Additional Services

Share in Twitter Search Google Scholar
Author:Simon Schenk, Steffen Staab
Series (Volume no.):Arbeitsberichte, FB Informatik (2007,3)
Document Type:Part of Periodical
Date of completion:2007/07/04
Date of publication:2007/07/04
Publishing institution:Universität Koblenz-Landau, Campus Koblenz, Universitätsbibliothek
Release Date:2007/07/04
Tag:RDF Graphs; Resource Description Framework (RDF)
Number of pages:15
Institutes:Fachbereich 4 / Fachbereich 4
Fachbereich 4 / Institut für Informatik
Dewey Decimal Classification:0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik
Licence (German):License LogoEs gilt das deutsche Urheberrecht: § 53 UrhG