graph

RDF Graph Patterns and Templates


This vocabulary defines terms used to describe RDF Graph patterns and templates as used in RDF Query languages (e.g. SPARQL) and elsewhere. The goal of the design is to model common parts of these languages in RDF in a way that allows for the generation of the actual queries in their native format. Note that only patterns and templates are modeled, not complete queries. A basic pattern/template is a set of reified RDF statements (reification is similar to the one built-in into RDF). Leaves of a reified triple are URIs, literals (stand for themselves) or blank nodes (variables). Variables have no names; blank nodes can be assigned nodeIDs and shared in a normal RDF way. More complex patterns are built by joining and filtering simpler patterns. Joining (cf. SPARQL UNION, regexp |) allows specification of alternative patterns; filtering (cf. SPARQL FILTER) constrains the allowable binding of variables.

Properties: value constraint expressionpattern for subjectarg3members of a setbase pattern for filteringsecond argumentfirst argumentpattern for object and pattern for predicate

Classes: Union of PatternsRDFterm-equal(A, B)RDF Graph Pattern/TemplateA || BFilter PatternRDF Statement Pattern/TemplateisURI(A)isBlank(A)Value Constraint Expression and isLiteral(A)

Examples

No examples yet, add one.