a ; "

OFFSET

\n\n

OFFSET causes the solutions generated to start after the specified number of solutions. An OFFSET of zero has no effect.

\n

Using LIMIT and OFFSET to select different subsets of the query solutions will not be useful unless the order is made predictable by using ORDER BY.

\n
PREFIX foaf:    <http://xmlns.com/foaf/0.1/>\n\nSELECT  ?name\nWHERE   { ?x foaf:name ?name }\nORDER BY ?name\nLIMIT   5\nOFFSET  10\n
"^^ ; ; "OFFSET" . a ; "

LIMIT

\n\n

The LIMIT clause puts an upper bound on the number of solutions returned. If the number of actual solutions, after OFFSET is applied, is greater than the limit, then at most the limit number of solutions will be returned.

\n
PREFIX foaf:    <http://xmlns.com/foaf/0.1/>\n\nSELECT ?name\nWHERE { ?x foaf:name ?name }\nLIMIT 20\n
\n

A LIMIT of 0 would cause no results to be returned. A limit may not be negative.

"^^ ; ; "LIMIT" . a ; ; ; ; ; ; ; "2023-07-10T15:46:30.239Z"^^ ; "Solution Sequences and Modifiers" ; ; ; . a ; "

Projection

\n\n

The solution sequence can be transformed into one involving only a subset of the variables. For each solution in the sequence, a new solution is formed using a specified selection of the variables using the SELECT query form.

\n

The following example shows a query to extract just the names of people described in an RDF graph using FOAF properties.

\n
@prefix foaf:        <http://xmlns.com/foaf/0.1/> .\n\n_:a  foaf:name       \"Alice\" .\n_:a  foaf:mbox       <mailto:alice@work.example> .\n\n_:b  foaf:name       \"Bob\" .\n_:b  foaf:mbox       <mailto:bob@work.example> .\n
\n
PREFIX foaf:       <http://xmlns.com/foaf/0.1/>\nSELECT ?name\nWHERE\n { ?x foaf:name ?name }\n
\n\n \n \n \n \n \n \n \n \n \n
name
\"Bob\"
\"Alice\"
"^^ ; ; "Projection" . a ; "

Duplicate Solutions

\n\n

A solution sequence with no DISTINCT or REDUCED query modifier will preserve duplicate solutions.

\n

Data:

\n
@prefix  foaf:  <http://xmlns.com/foaf/0.1/> .\n\n_:x    foaf:name   \"Alice\" .\n_:x    foaf:mbox   <mailto:alice@example.com> .\n\n_:y    foaf:name   \"Alice\" .\n_:y    foaf:mbox   <mailto:asmith@example.com> .\n\n_:z    foaf:name   \"Alice\" .\n_:z    foaf:mbox   <mailto:alice.smith@example.com> .\n
\n

Query:

\n
PREFIX foaf:    <http://xmlns.com/foaf/0.1/>\nSELECT ?name WHERE { ?x foaf:name ?name }\n
\n

Results:

\n\n \n \n \n \n \n \n \n \n \n \n \n \n
name
\"Alice\"
\"Alice\"
\"Alice\"
\n\n

The modifiers DISTINCT and REDUCED affect whether duplicates are included in the query results.

\n

DISTINCT

\n\n

The DISTINCT solution modifier eliminates duplicate solutions. Only one solution solution that binds the same variables to the same RDF terms is returned from the query.

\n
PREFIX foaf:    <http://xmlns.com/foaf/0.1/>\nSELECT DISTINCT ?name WHERE { ?x foaf:name ?name }\n
\n\n \n \n \n \n \n \n
name
\"Alice\"
\n\n

Note that, per the order of solution sequence modifiers, duplicates are eliminated before either limit or offset is applied.

\n

REDUCED

\n\n

While the DISTINCT modifier ensures that duplicate solutions are eliminated from the solution set, REDUCED simply permits them to be eliminated. The cardinality of any set of variable bindings in a REDUCED solution set is at least one and not more than the cardinality of the solution set with no DISTINCT or REDUCED modifier. For example, using the data above, the query

\n
PREFIX foaf:    <http://xmlns.com/foaf/0.1/>\nSELECT REDUCED ?name WHERE { ?x foaf:name ?name }\n
\n

may have one, two (shown here) or three solutions:

\n\n \n \n \n \n \n \n \n \n \n
name
\"Alice\"
\"Alice\"
"^^ ; ; ; "Duplicate Solutions" . a , ; "

Solution Sequences and Modifiers

\n\n

Query patterns generate an unordered collection of solutions, each solution being a partial function from variables to RDF terms. These solutions are then treated as a sequence (a solution sequence), initially in no specific order; any sequence modifiers are then applied to create another sequence. Finally, this latter sequence is used to generate one of the results of a SPARQL query form.

\n

A solution sequence modifier is one of:

\n
    \n
  • Order modifier: put the solutions in order
    • \n
  • Projection modifier: choose certain variables
    • \n
  • Distinct modifier: ensure solutions in the sequence are unique
    • \n
  • Reduced modifier: permit elimination of some non-distinct solutions
    • \n
  • Offset modifier: control where the solutions start from in the overall sequence of solutions
    • \n
  • Limit modifier: restrict the number of solutions
    • \n
\n

Modifiers are applied in the order given by the list above.

"^^ ; ; "Solution Sequences and Modifiers" . a ; "

ORDER BY

\n\n

The ORDER BY clause establishes the order of a solution sequence.

\n

Following the ORDER BY clause is a sequence of order comparators, composed of an expression and an optional order modifier (either ASC() or DESC()). Each ordering comparator is either ascending (indicated by the ASC() modifier or by no modifier) or descending (indicated by the DESC() modifier).

\n
PREFIX foaf:    <http://xmlns.com/foaf/0.1/>\n\nSELECT ?name\nWHERE { ?x foaf:name ?name }\nORDER BY ?name\n
\n
PREFIX     :    <http://example.org/ns#>\nPREFIX foaf:    <http://xmlns.com/foaf/0.1/>\n\nSELECT ?name\nWHERE { ?x foaf:name ?name ; :empId ?emp }\nORDER BY DESC(?emp)\n
\n
PREFIX     :    <http://example.org/ns#>\nPREFIX foaf:    <http://xmlns.com/foaf/0.1/>\n\nSELECT ?name\nWHERE { ?x foaf:name ?name ; :empId ?emp }\nORDER BY ?name DESC(?emp)\n
\n

The \"<\" operator (see the Operator Mapping and 17.3.1 Operator Extensibility) defines the relative order of pairs of numerics, simple literals, xsd:strings, xsd:booleans and xsd:dateTimes. Pairs of IRIs are ordered by comparing them as simple literals.

\n

SPARQL also fixes an order between some kinds of RDF terms that would not otherwise be ordered:

\n
    \n
  1. (Lowest) no value assigned to the variable or expression in this solution.
    2. \n
  2. Blank nodes
    3. \n
  3. IRIs
    4. \n
  4. RDF literals
    5. \n
\n

A plain literal is lower than an RDF literal with type xsd:string of the same lexical form.

\n

SPARQL does not define a total ordering of all possible RDF terms. Here are a few examples of pairs of terms for which the relative order is undefined:

\n
    \n
  • \"a\" and \"a\"@en_gb (a simple literal and a literal with a language tag)
    • \n
  • \"a\"@en_gb and \"b\"@en_gb (two literals with language tags)
    • \n
  • \"a\" and \"1\"^^xsd:integer (a simple literal and a literal with a supported datatype)
    • \n
  • \"1\"^^my:integer and \"2\"^^my:integer (two unsupported datatypes)
    • \n
  • \"1\"^^xsd:integer and \"2\"^^my:integer (a supported datatype and an unsupported datatype)
    • \n
\n

This list of variable bindings is in ascending order:

\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
RDF TermReason
Unbound results sort earliest.
\n _:z\n Blank nodes follow unbound.
\n _:a\n There is no relative ordering of blank nodes.
\n <http://script.example/Latin>\n IRIs follow blank nodes.
\n <http://script.example/Кириллица>\n The character in the 23rd position, \"К\", has a unicode codepoint 0x41A, which is higher than 0x4C (\"L\").
\n <http://script.example/漢字>\n The character in the 23rd position, \"漢\", has a unicode codepoint 0x6F22, which is higher than 0x41A (\"К\").
\n \"http://script.example/Latin\"\n Simple literals follow IRIs.
\n \"http://script.example/Latin\"^^xsd:string\n xsd:strings follow simple literals.
\n\n

The ascending order of two solutions with respect to an ordering comparator is established by substituting the solution bindings into the expressions and comparing them with the \"<\" operator. The descending order is the reverse of the ascending order.

\n

The relative order of two solutions is the relative order of the two solutions with respect to the first ordering comparator in the sequence. For solutions where the substitutions of the solution bindings produce the same RDF term, the order is the relative order of the two solutions with respect to the next ordering comparator. The relative order of two solutions is undefined if no order expression evaluated for the two solutions produces distinct RDF terms.

\n

Ordering a sequence of solutions always results in a sequence with the same number of solutions in it.

\n

Using ORDER BY on a solution sequence for a CONSTRUCT or DESCRIBE query has no direct effect because only SELECT returns a sequence of results. Used in combination with LIMIT and OFFSET, ORDER BY can be used to return results generated from a different slice of the solution sequence. An ASK query does not include ORDER BY, LIMIT or OFFSET.

"^^ ; , , ; ; "ORDER BY" .