Skip main navigation
We use cookies to give you a better experience, if that’s ok you can close this message and carry on browsing. For more info read our cookies policy.
We use cookies to give you a better experience. Carry on browsing if you're happy with this, or read our cookies policy for more information.

Introducing terminology for SPARQL (glossary)

Before proceeding to the detailed structure of queries, it is worth pausing to review the concepts introduced so far.

Throughout the material on SPARQL, you may come across terms that are unfamiliar. This step consists of a comprehensive glossary of related terms.

Glossary

If you wish to download a version of this glossary it is available in PDF format at the bottom of this page.

RDF triple

An RDF triple is a statement of the form subject-predicate-object expressed in one of the RDF formalisms.

RDF triple pattern

An RDF triple pattern is the same as an RDF triple except that any or all of its three constituents may be replaced by a variable.

RDF graph

An RDF graph is a set of RDF triples. You may already know that ‘graph’ in mathematics has two distinct meanings:

(1) a diagram showing points arranged by their relationship to an X axis and a Y axis;

(2) a set of vertices (or nodes) linked by edges (or arcs).

In the case of RDF the second meaning applies, where the subject and object in a triple are vertices, and the predicate is an edge that links them by pointing from subject to object.

Formally, an RDF graph can be described as a directed labelled multigraph, which means (a) that edges are directional (you cannot switch subject and object without changing the statement), (b) that edges are named (by the predicate identifier), and (c) that there can be multiple edges linking two vertices (resources may be related in different ways).

RDF dataset

An RDF dataset is a set of RDF triples comprising a default RDF graph, which by definition is unnamed, and zero or more named RDF graphs. The idea behind this segmentation is that SPARQL queries can be explicitly confined to a named subset rather than running over the whole dataset.

Graph pattern

We use this term to refer to a conjunction of RDF triple patterns. It is therefore the same as an RDF graph, except that its constituents are RDF triple patterns (which contain variables) as opposed to normal RDF triples (which don’t). Note that in a query, the expression following the keyword WHERE is a graph pattern; this is why graph patterns are important.

SPARQL Protocol client

A SPARQL Protocol client is an HTTP client that sends requests for SPARQL Protocol operations. As you probably know, ‘client’ here refers to a program that sends a request to another program, possibly running on another computer, over a network; the other computer is known as the ‘server’.

SPARQL Protocol service

A SPARQL Protocol service is an HTTP server that services requests for SPARQL Protocol operations.

SPARQL endpoint

A SPARQL endpoint is a SPARQL Protocol service, identified by a given URL, which listens for requests from SPARQL clients.


Share this article:

This article is from the free online course:

Introduction to Linked Data and the Semantic Web

University of Southampton

Get a taste of this course

Find out what this course is like by previewing some of the course steps before you join:

  • Welcome to the course
    Welcome to the course
    video

    Watch Dr Elena Simperl & Dr Barry Norton explain how this short course on linked data & the semantic web can help you use this technology in your work

  • Developing real world applications
    Developing real world applications
    video

    Watch Dr Barry Norton describing some real world applications that have Linked Data as their underlying technology.

  • Welcome to Week 2
    Welcome to Week 2
    video

    Watch Dr Barry Norton explain what you will learn about SPARQL (the query language) on this course and what you will be practicing.

Contact FutureLearn for Support