IF

\n\n

rdfTerm  IF (expression1, expression2, expression3)\n

The IF function form evaluates the first argument, interprets it as a effective boolean value, then returns the value of expression2 if the EBV is true, otherwise it returns the value of expression3. Only one of expression2 and expression3 is evaluated. If evaluating the first argument raises an error, then an error is raised for the evaluation of the IF expression.

Examples: Suppose ?x = 2, ?z = 0 and ?y is not bound in some query solution:

\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 `IF(?x = 2, \"yes\", \"no\")`\n	returns \"yes\"
\n `IF(bound(?y), \"yes\", \"no\")`\n	returns \"no\"
\n `IF(?x=2, \"yes\", 1/?z)`\n	returns \"yes\", the expression `1/?z` is not evaluated
\n `IF(?x=1, \"yes\", 1/?z)`\n	raises an error
\n `IF(\"2\" > 1, \"yes\", \"no\")`\n	raises an error

"^^ ; ; . a ; "

sameTerm

\n\n

 xsd:boolean  sameTerm (RDF term term1, RDF term term2)\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       \"Ms A.\".\n_:b  foaf:mbox       <mailto:alice@work.example> .\n

This query finds the people who have multiple foaf:name triples:

PREFIX foaf: <http://xmlns.com/foaf/0.1/>\nSELECT ?name1 ?name2\nWHERE { ?x foaf:name  ?name1 ;\n        foaf:mbox  ?mbox1 .\n         ?y foaf:name  ?name2 ;\n         foaf:mbox  ?mbox2 .\n         FILTER (sameTerm(?mbox1, ?mbox2) && !sameTerm(?name1, ?name2))\n      } \n

Query result:

\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n

name1	name2
\"Alice\"	\"Ms A.\"
\"Ms A.\"	\"Alice\"

\n\n

Unlike RDFterm-equal , sameTerm can be used to test for non-equivalent typed literals with unsupported datatypes:

@prefix :          <http://example.org/WMterms#> .\n@prefix t:         <http://example.org/types#> .\n\n_:c1  :label        \"Container 1\" .\n_:c1  :weight       \"100\"^^t:kilos .\n_:c1  :displacement  \"100\"^^t:liters .\n\n_:c2  :label        \"Container 2\" .\n_:c2  :weight       \"100\"^^t:kilos .\n_:c2  :displacement  \"85\"^^t:liters .\n\n_:c3  :label        \"Container 3\" .\n_:c3  :weight       \"85\"^^t:kilos .\n_:c3  :displacement  \"85\"^^t:liters .\n

PREFIX  :      <http://example.org/WMterms#>\nPREFIX  t:     <http://example.org/types#>\n\nSELECT ?aLabel1 ?bLabel\nWHERE { ?a  :label        ?aLabel .\n        ?a  :weight       ?aWeight .\n        ?a  :displacement ?aDisp .\n\n        ?b  :label        ?bLabel .\n        ?b  :weight       ?bWeight .\n        ?b  :displacement ?bDisp .\n\n        FILTER ( sameTerm(?aWeight, ?bWeight) && !sameTerm(?aDisp, ?bDisp)) }\n

\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n

aLabel	bLabel
\"Container 1\"	\"Container 2\"
\"Container 2\"	\"Container 1\"

\n\n

The test for boxes with the same weight may also be done with the '=' operator (RDFterm-equal) as the test for \"100\"^^t:kilos = \"85\"^^t:kilos will result in an error, eliminating that potential solution.

"^^ ; , , ; . a ; "

bound

\n\n

xsd:boolean  BOUND (variable var)\n

Returns true if var is bound to a value. Returns false otherwise. Variables with the value NaN or INF are considered bound.

Data:

@prefix foaf:        <http://xmlns.com/foaf/0.1/> .\n@prefix dc:          <http://purl.org/dc/elements/1.1/> .\n@prefix xsd:          <http://www.w3.org/2001/XMLSchema#> .\n\n_:a  foaf:givenName  \"Alice\".\n\n_:b  foaf:givenName  \"Bob\" .\n_:b  dc:date         \"2005-04-04T04:04:04Z\"^^xsd:dateTime .\n

PREFIX foaf: <http://xmlns.com/foaf/0.1/>\nPREFIX dc:   <http://purl.org/dc/elements/1.1/>\nPREFIX xsd:   <http://www.w3.org/2001/XMLSchema#>\nSELECT ?givenName\n WHERE { ?x foaf:givenName  ?givenName .\n         OPTIONAL { ?x dc:date ?date } .\n         FILTER ( bound(?date) ) }\n

Query result:

\n\n \n \n \n \n \n \n \n \n

givenName
\"Bob\"

\n\n

One may test that a graph pattern is not expressed by specifying an OPTIONALgraph\npattern that introduces a variable and testing to see that the variable is notbound. This is called Negation as Failure in logic programming.

This query matches the people with a name but no expressed date:

PREFIX foaf: <http://xmlns.com/foaf/0.1/>\nPREFIX dc:   <http://purl.org/dc/elements/1.1/>\nSELECT ?name\n WHERE { ?x foaf:givenName  ?name .\n         OPTIONAL { ?x dc:date ?date } .\n         FILTER (!bound(?date)) }\n

Query result:

\n\n \n \n \n \n \n \n \n \n

name
\"Alice\"

\n\n

Because Bob's dc:date was known, \"Bob\" was not a solution to the query.

"^^ ; . a ; "

logical-or

\n\n

 xsd:boolean  xsd:boolean left || xsd:boolean right\n

Returns a logical OR of left and right. Note that logical-or operates on the effective boolean value of its arguments.

Note: see section 17.2, Filter Evaluation, for the || operator's treatment of errors.

"^^ ; , ; . a ; "

IN

\n\n

boolean  rdfTerm IN (expression, ...)\n

The IN operator tests whether the RDF term on the left-hand side is found in the values of list of expressions on the right-hand side. The test is done with \"=\" operator, which tests for the same value, as determined by the operator mapping.

A list of zero terms on the right-hand side is legal.

Errors in comparisons cause the IN expression to raise an error if the RDF term being tested is not found elsewhere in the list of terms.

The IN operator is equivalent to the SPARQL expression:

(lhs = expression1) || (lhs = expression2) || ...\n

Examples:

\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 `2 IN (1, 2, 3)`\n	true
\n `2 IN ()`\n	false
\n `2 IN (<http://example/iri>, \"str\", 2.0)`\n	true
\n `2 IN (1/0, 2)`\n	true
\n `2 IN (2, 1/0)`\n	true
\n `2 IN (3, 1/0)`\n	raises an error

"^^ ; ; . a ; "

COALESCE

\n\n

rdfTerm  COALESCE(expression, ....)\n

The COALESCE function form returns the RDF term value of the first expression that evaluates without error. In SPARQL, evaluating an unbound variable raises an error.

If none of the arguments evaluates to an RDF term, an error is raised. If no expressions are evaluated without error, an error is raised.

Examples: Suppose ?x = 2 and ?y is not bound in some query solution:

\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 `COALESCE(?x, 1/0)`\n	returns 2, the value of `x`\n
\n `COALESCE(1/0, ?x)`\n	returns 2
\n `COALESCE(5, ?x)`\n	returns 5
\n `COALESCE(?y, 3)`\n	returns 3
\n `COALESCE(?y)`\n	raises an error because `y` is not bound.

"^^ ; . a ; ; ; ; ; ; ; ; ; ; ; ; "2023-07-10T15:25:09.498Z"^^ ; "Functional Forms" ; ; ; . a ; "

RDFterm-equal

\n\n

 xsd:boolean  RDF term term1 = RDF term term2\n

Returns TRUE if term1 and term2 are the same RDF term as defined in Resource Description Framework (RDF): Concepts and Abstract Syntax [Resource Description Framework (RDF): Concepts and Abstract Syntax]; produces a type error if the arguments are both literal but are not the same RDF term *; returns FALSE otherwise. term1 and term2 are the same if any of the following is true:

term1 and term2 are equivalent IRIs as defined in 6.4 RDF URI References of [Resource Description Framework (RDF): Concepts and Abstract Syntax].
term1 and term2 are equivalent literals as defined in 6.5.1 Literal Equality of [Resource Description Framework (RDF): Concepts and Abstract Syntax].
term1 and term2 are the same blank node as described in 6.6 Blank Nodes of [Resource Description Framework (RDF): Concepts and Abstract Syntax].

@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       \"Ms A.\".\n_:b  foaf:mbox       <mailto:alice@work.example> .\n\n

This query finds the people who have multiple foaf:name triples:

PREFIX foaf: <http://xmlns.com/foaf/0.1/>\nSELECT ?name1 ?name2\nWHERE { ?x foaf:name  ?name1 ;\n        foaf:mbox  ?mbox1 .\n        ?y foaf:name  ?name2 ;\n        foaf:mbox  ?mbox2 .\n        FILTER (?mbox1 = ?mbox2 && ?name1 != ?name2)\n      }\n

Query result:

\n\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n

name1	name2
\"Alice\"	\"Ms A.\"
\"Ms A.\"	\"Alice\"

\n\n

In this query for documents that were annotated at a specific date and time (New Year's Day 2005, measures in timezone +00:00), the RDF terms are not the same, but have equivalent values:

@prefix a:          <http://www.w3.org/2000/10/annotation-ns#> .\n@prefix dc:         <http://purl.org/dc/elements/1.1/> .\n\n_:b   a:annotates   <http://www.w3.org/TR/rdf-sparql-query/> .\n_:b   dc:date       \"2004-12-31T19:00:00-05:00\"^^<http://www.w3.org/2001/XMLSchema#dateTime> .\n

PREFIX a:      <http://www.w3.org/2000/10/annotation-ns#>\nPREFIX dc:     <http://purl.org/dc/elements/1.1/>\nPREFIX xsd:    <http://www.w3.org/2001/XMLSchema#>\n\nSELECT ?annotates\nWHERE { ?annot  a:annotates  ?annotates .\n        ?annot  dc:date      ?date .\n        FILTER ( ?date = xsd:dateTime(\"2005-01-01T00:00:00Z\") ) \n      }\n

\n\n \n \n \n \n \n \n \n \n

annotates
<http://www.w3.org/TR/rdf-sparql-query/>

\n\n

Invoking RDFterm-equal on two typed literals tests for equivalent values. An extended implementation may have support for additional datatypes. An implementation processing a query that tests for equivalence on unsupported datatypes (and non-identical lexical form and datatype IRI) returns an error, indicating that it was unable to determine whether or not the values are equivalent. For example, an unextended implementation will produce an error when testing either \"iiii\"^^my:romanNumeral = \"iv\"^^my:romanNumeral or \"iiii\"^^my:romanNumeral != \"iv\"^^my:romanNumeral.

"^^ ; , , , , ; . a ; "

17.4.1.10 NOT IN

\n\n

boolean  rdfTerm NOT IN (expression, ...)\n

The NOT IN operator tests whether the RDF term on the left-hand side is not found in the values of list of expressions on the right-hand side. The test is done with \"!=\" operator, which tests for not the same value, as determined by the operator mapping.

A list of zero terms on the right-hand side is legal.

Errors in comparisons cause the NOT IN expression to raise an error if the RDF term being tested is not found to be in the list elsewhere in the list of terms.

The NOT IN operator is equivalent to the SPARQL expression:

(lhs != expression1) && (lhs != expression2) && ...\n

NOT IN (...) is equivalent to !(IN (...)).

Examples:

\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 `2 NOT IN (1, 2, 3)`\n	false
\n `2 NOT IN ()`\n	true
\n `2 NOT IN (<http://example/iri>, \"str\", 2.0)`\n	false
\n `2 NOT IN (1/0, 2)`\n	false
\n `2 NOT IN (2, 1/0)`\n	false
\n `2 NOT IN (3, 1/0)`\n	raises an error

"^^ ; ; . a ; "

NOT EXISTS and EXISTS

\n\n

There is a filter operator EXISTS that takes a graph pattern. EXISTS returns true/false depending on whether the pattern matches the dataset given the bindings in the current group graph pattern, the dataset and the active graph at this point in the query evaluation. No additional binding of variables occurs. The NOT EXISTS form translates into fn:not(EXISTS{...}).

 xsd:boolean  NOT EXISTS { pattern }\n

Returns false if pattern matches. Returns true otherwise.

NOT EXISTS { pattern } is equivalent to fn:not(EXISTS { pattern }).

 xsd:boolean  EXISTS { pattern }\n

Returns true if pattern matches. Returns false otherwise.

Variables in the pattern that are bound in the current solution mapping take the value that they have from the solution mapping. Variables in the pattern pattern that are not bound in the current solution mapping take part in pattern matching.

To facilitate this, we introduce a function Exists that evaluates a SPARQL Algebra expression and returns true or false, depending on whether there are any solutions to the pattern, given the solution mapping being tested by the filter operation.

"^^ ; , , ; . a , ; "

Functional Forms

"^^ ; ; "Functional Forms" . a ; "

logical-and

\n\n

 xsd:boolean  xsd:boolean left && xsd:boolean right\n

Returns a logical AND of left and right. Note that logical-and operates on the effective boolean value of its arguments.

Note: see section 17.2, Filter Evaluation, for the && operator's treatment of errors.

"^^ ; , ; .