RDF 1.1 Primer Abstract This primer is designed to provide the reader with the basic knowledge required to effectively use RDF. It introduces the basic concepts of RDF and shows concrete examples of the use of RDF. Secs. 3-5 can be used as a minimalist introduction into the key elements of RDF. Changes between RDF 1.1 and RDF 1.0 (2004 version) are summarized in a separate document: "What's New in RDF 1.1" [RDF11-NEW]. Status of This Document This section describes the status of this document at the time of its publication. This document is part of the RDF 1.1 document suite. This document was published by the RDF Working Group as a Working Group Note. Publication as a Working Group Note does not imply endorsement by the W3C Membership. This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. Table of Contents 1. The Resource Description Framework (RDF) is a framework for expressing information about resources. 2. 3. 3.1 Triples Example 1: Sample triples (informal) Note
RDF 1.1 Concepts and Abstract Syntax Abstract The Resource Description Framework (RDF) is a framework for representing information in the Web. This document defines an abstract syntax (a data model) which serves to link all RDF-based languages and specifications. The abstract syntax has two key data structures: RDF graphs are sets of subject-predicate-object triples, where the elements may be IRIs, blank nodes, or datatyped literals. Status of This Document This section describes the status of this document at the time of its publication. This document is part of the RDF 1.1 document suite. This document was published by the RDF Working Group as a Recommendation. This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. Table of Contents 1. This section is non-normative. 1.1 Graph-based Data Model Any IRI or literal .
RDF 1.1 Turtle Abstract The Resource Description Framework (RDF) is a general-purpose language for representing information in the Web. This document defines a textual syntax for RDF called Turtle that allows an RDF graph to be completely written in a compact and natural text form, with abbreviations for common usage patterns and datatypes. Turtle provides levels of compatibility with the N-Triples [N-TRIPLES] format as well as the triple pattern syntax of the SPARQL W3C Recommendation. Status of This Document This section describes the status of this document at the time of its publication. This document is a part of the RDF 1.1 document suite. This document was published by the RDF Working Group as a Recommendation. Please see the Working Group's implementation report. This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. Table of Contents 1. This section is non-normative. Example 1
RDF 1.1 XML Syntax Status of This Document This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at This document is an edited version of the 2004 RDF XML Syntax Specification Recommendation. This document was published by the RDF Working Group as a Recommendation. This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. 2. This section introduces the RDF/XML syntax, describes how it encodes RDF graphs and explains this with examples. 2.1 Introduction Several RDF/XML examples are given in the following sections building up to complete RDF/XML documents. Example 1 Example 2
RDF 1.1 N-Triples Abstract N-Triples is a line-based, plain text format for encoding an RDF graph. Status of This Document This section describes the status of this document at the time of its publication. Other documents may supersede this document. This document is part of the RDF 1.1 document suite. This document was published by the RDF Working Group as a Recommendation. Please see the Working Group's implementation report. This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. Table of Contents 1. This document defines N-Triples, a concrete syntax for RDF [RDF11-CONCEPTS]. The syntax is a revised version of N-Triples as originally defined in the RDF Test Cases [RDF-TESTCASES] document. An N-Triples document contains no parsing directives. 2. 2.1 Simple Triples 2.2 IRIs 2.3 RDF Literals 3. 4. 5.
RDF 1.1 TriG Abstract This document defines a textual syntax for RDF called TriG that allows an RDF dataset to be completely written in a compact and natural text form, with abbreviations for common usage patterns and datatypes. TriG is an extension of the Turtle [TURTLE] format. Status of This Document This section describes the status of this document at the time of its publication. This document is part of the RDF 1.1 document suite. This document was published by the RDF Working Group as a Recommendation. Please see the Working Group's implementation report. This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. Table of Contents 1. This document defines TriG, a concrete syntax for RDF as defined in the RDF Concepts and Abstract Syntax document [RDF11-CONCEPTS]. 2. 2.1 Triple Statements
RDF 1.1 N-Quads Abstract N-Quads is a line-based, plain text format for encoding an RDF dataset. Status of This Document This section describes the status of this document at the time of its publication. This document is part of the RDF 1.1 document suit. This document was published by the RDF Working Group as a Recommendation. Please see the Working Group's implementation report. This document has been reviewed by W3C Members, by software developers, and by other W3C groups and interested parties, and is endorsed by the Director as a W3C Recommendation. This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. Table of Contents 1. This document defines N-Quads, an easy to parse, line-based, concrete syntax for RDF Datasets [RDF11-CONCEPTS]. N-quads statements are a sequence of RDF terms representing the subject, predicate, object and graph label of an RDF Triple and the graph it is part of in a dataset. 2. 2.1 Simple Statements 2.2 IRIs 2.3 RDF Literals 2.4 RDF Blank Nodes
SPARQL 1.1 Overview 1 Introduction SPARQL 1.1 is a set of specifications that provide languages and protocols to query and manipulate RDF graph content on the Web or in an RDF store. The standard comprises the following specifications: 2 SPARQL 1.1 Query Language Assuming the graph data from above is loaded into a SPARQL service (i.e., an HTTP service endpoint that can process SPARQL queries), the SPARQL 1.1 Query Language can be used to formulate queries ranging from simple graph pattern matching to complex queries. Just like in the earlier SPARQL1.0 specification [SPARQL-Query] from 2008, complex queries may include union, optional query parts, and filters; new features like value aggregation, path expressions, nested queries, etc. have been added in SPARQL 1.1. Compared to SPARQL1.0, SPARQL 1.1 adds a number of new features to the query language, including subqueries, value assignment, path expressions, or aggregates - such as COUNT, as used in the above example query - etc. <? ? 4 SPARQL 1.1 Federated Query
SPARQL 1.1 Query Language This section defines the correct behavior for evaluation of graph patterns and solution modifiers, given a query string and an RDF dataset. It does not imply a SPARQL implementation must use the process defined here. The outcome of executing a SPARQL query is defined by a series of steps, starting from the SPARQL query as a string, turning that string into an abstract syntax form, then turning the abstract syntax into a SPARQL abstract query comprising operators from the SPARQL algebra. This abstract query is then evaluated on an RDF dataset. 18.2 Translation to the SPARQL Algebra This section defines the process of converting graph patterns and solution modifiers in a SPARQL query string into a SPARQL algebra expression. The SPARQL query string is parsed and the abbreviations for IRIs and triple patterns given in section 4 are applied. The result of converting such an abstract syntax tree is a SPARQL query that uses the following symbols in the SPARQL algebra: 18.2.1 Variable Scope Notes: ?
SPARQL 1.1 Update Graph update operations change existing graphs in the Graph Store but do not explicitly delete nor create them. Non-empty inserts into non-existing graphs will, however, implicitly create those graphs, i.e., an implementation fulfilling an update request SHOULD silently an automatically create graphs that do not exist before triples are inserted into them, and MUST return with failure if it fails to do so for any reason. (For example, the implementation may have insufficient resources, or an implementation may only provide an update service over a fixed set of graphs and the implicitly created graph is not within this fixed set). An implementation MAY remove graphs that are left empty after triples are removed from them. If a graph is created implicitly by an update operation, then the behavior of the Graph Store MUST be functionally equivalent to its behavior if the graph had been created explicitly by a CREATE operation. INSERT DATA QuadData ( GRAPH VarOrIri )? does not create <g>.
SPARQL Query Results XML Format (Second Edition) W3C Recommendation 21 March 2013 This version: Latest version: Previous version: Previous Recommendation: Second Edition Editor: Sandro Hawke Editors: Dave Beckett, Institute for Learning and Research Technology (ILRT), University of Bristol Jeen Broekstra, Information Systems Group, Eindhoven University of Technology Please refer to the errata for this document, which may include some normative corrections. See also translations. Copyright © 2013 W3C® (MIT, ERCIM, Keio, Beihang), All Rights Reserved. Abstract RDF is a flexible, extensible way to represent information about World Wide Web resources. 1. The SPARQL Query Language for RDF[SPARQL-QUERY] defines several Query Result Forms (SPARQL Query section 10). 2. Definition: SPARQL Results Document 2.1. <? 2.2. <? <? 2.3. 2.3.1. <? <? RDF Literal S
SPARQL 1.1 Federated Query Abstract RDF is a directed, labeled graph data format for representing information in the Web. SPARQL can be used to express queries across diverse data sources, whether the data is stored natively as RDF or viewed as RDF via middleware. This specification defines the syntax and semantics of SPARQL 1.1 Federated Query extension for executing queries distributed over different SPARQL endpoints. The SERVICE keyword extends SPARQL 1.1 to support queries that merge data distributed across the Web. 1 Introduction The growing number of SPARQL query services offer data consumers an opportunity to merge data distributed across the Web. 1.1 Document Conventions 1.1.2 Result Descriptions Result sets are illustrated in tabular form as in the SPARQL 1.1 Query document. A 'binding' is a pair (variable, RDF term). 2 SPARQL 1.1 Federated Query Extension The SERVICE keyword instructs a federated query processor to invoke a portion of a SPARQL query against a remote SPARQL endpoint. Query: Query Result: then: ?