Opened 14 years ago
Closed 14 years ago
#84 closed task (fixed)
define the design of the implementation
Reported by: | lgiessmann | Owned by: | lgiessmann |
---|---|---|---|
Priority: | major | Milestone: | SPARQL interface |
Component: | TM-SPARQL | Version: | 0.1 |
Keywords: | Cc: |
Description
Common Form
((PREFIX bounding: <uri-prefix>)|(PREFIX : <uri-prefix>)*
(BASE <base-uri>)*)*
SELECT ?varName+
WHERE {
(({?subjectOrVarName predicateOrVarName objectOrVarName}?)*
({?FILTER (filterExpression)}?)*
(BASE <base-uri>)*)*
}
Grouping
{}
Base
BASE <uri>
…
<book>
-> uri/book
Literals
(“anyCharacter*“)|(‘anyCharacter*‘)((anyUri)|(@languageTag)){0,1}
Variables
($anyChar*)|(?anyChar*)
?var = $var
Predicate object-lists
?x foaf:name ?name ;
foaf:mbox ?mbox .
This is the same as writing the triple patterns:
?x foaf:name ?name .
?x foaf:mbox ?mbox .
rdf:type
rdf:type = a
Empty Graph Pattern
The group pattern:
{ }
matches any graph (including the empty graph) with one solution that does not bind any variables. For example:
SELECT ?x
WHERE {}
matches with one solution in which variable x is not bound.
Attachments (1)
Change History (3)
comment:1 Changed 14 years ago by
Status: | new → accepted |
---|
Changed 14 years ago by
Attachment: | Isidorus-SPARQL.jpg added |
---|
comment:2 Changed 14 years ago by
Resolution: | → fixed |
---|---|
Status: | accepted → closed |