W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > April to June 2011

Re: Typos in Query document (2)

From: Andy Seaborne <andy.seaborne@epimorphics.com>
Date: Thu, 28 Apr 2011 11:10:17 +0100
Message-ID: <4DB93D09.4080306@epimorphics.com>
To: public-rdf-dawg@w3.org
 > 17.4.5.1 now
 >
 > All calls to this function in any one query execution must return the
 > same value.
 > ->
 > What about federated query ?

 From the POV of the endpoint called, a query from a SERVICE call is 
indistinguishable from any other query.

I don't want to say "on one machine" (untrue on loop back).

Suggestions for rewording?

-------

Otherwise done,  as noted.

On 27/04/11 15:50, Olivier Corby wrote:
> Some typos in Query document.
>
> Olivier
>
>
>
>
> 9.2 Examples
> Example: Sequence
>
>
> -- ?x is not aligned
>
> { ?x foaf:mbox <mailto:alice@example> .
> ?x foaf:knows [ foaf:knows [ foaf:name ?name ]].
> }
>
>
> Example: Arbitrary length match
> ->
> Arbitrary length path (?)
>
>
>
>
> 9.3 Cycles and Duplicates
>
> if an RDF term in the data would be a matched again

If you can suggest better wording?

>
>
>
>
> 10.2 BINDINGS
>
> RDf term
> -> RDF term
>
>
>
> 11 Aggregates
>
> version 1.1 of SPARQL/Query
> ->
> version 1.1 of SPARQL

Steve - I changed this.

>
>
> 11.2 GROUP BY
>
> If aggregates are used in the query level, but the GROUP BY term is not
> used, then there is taken to be a single implicit group
> ->
> this is taken (?)
>

Steve - I changed this.

>
> 17.4.1.2 IF
>
> rdfTerm IF(expression1, expression2, expression3)
>
> The IF function form evaluates the first argument, interprets it as a
> effective boolean value, then returns the value of expr2 if the EBV is
> true, otherwise it returns the value of expr3.
> ->
> expression2 vs expr2
> expression3 vs expr3
>
>
> 17.4.1.4 NOT EXISTS and EXISTS
>
> theer
>
>
>
> 17.4.1.10 NOT IN
>
> comparsions
>
> check this:
> "the RDF term being tested is not found to be in the list elsewhere in
> the list of terms."
>
>
> NOT IN is equivalent to !(IN).
> ->
> lhs NOT IN list is equivalent to !(lhs IN list).

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

> 17.4.2.10 BNODE
>
> datset
>
> If the no argument form is used every call results in a distinct blank
> node.
> ->
> add a "," :
> If the no argument form is used, every call results in a distinct blank
> node.
>
>
>
> 17.4.2.11 STRDT
> 17.4.2.12 STRLANG
>
> The expression "simple literal lexicalForm" is used nowhere else in the
> document.

"simple literal" is the type of the argument lexicalForm

The CSS for all function prototypes is broken - I don't know why.

> 17.4.3.2 SUBSTR
>
> literal substr(literal source, xsd:integer startingLoc, xsd:integer length)
> ->
> Uppercase:
> SUBSTR()
>
>
>
> 17.4.5.1 now
>
> All calls to this function in any one query execution must return the
> same value.
> ->
> What about federated query ?
>
>
>
>
> 18.2 Translation to the SPARQL Algebra
>
> synatx
>
>
>
>
> 18.2.1 Variable Scope
>
>
> v is in-scope in an one or more of P1, P2, ...
> ->
> in one or more
>
>
> v is in-scope if v in varlist
> ->
> v is in-scope if v is in varlist
>
>
>
> 18.2.2.2 Translate Property Path Expressions
>
> synatx
>
>
> X path{0,} Y ?V path* Y
> ->
> X path{0,} Y X path* Y (?)
>
>
>
> 18.2.2.3 Translate Basic Graph Patterns
>
> collectied
>
> achived
>
>
>
>
> 18.2.2.4 Translate Pattens in Filters
> ->
> 18.2.2.4 Translate Patterns in Filters
>
>
>
> Example: Pattern involving MINUS:
>
> Minus(
> BGP(?s :p ?v)
> BGP(?s :p1 ?v2)
>
> ->
>
> A ")" is missing at the end
>
>
>
> 18.2.4 Converting BINDINGS, Groups, Aggregates and SELECT Expressions
>
> # Grouping
> # Aggregates
> # BINDINGS
> # Select expressions
> # Having
>
> BINDINGS is the only one in uppercase in the list above.
>
>
>
> 18.2.4.4 SELECT Expressions
>
> Not visible: only in filter, exists/not exists, masked by a subselect,
> non-projected GROUP variables.
>
> ->
>
> + Right hand side of MINUS
>
>
>
> Definition: Count
>
> applied transitively,(see definition below)
> ->
> add a space:
> applied transitively, (see definition below)
>
>
>
> Definition: Evaluation of ZeroLengthPath
>
> eval(D(G), ZeroLengthPath(vx:var, path, vy:var))) =
> { {(vx, term), (vy, term)} | term in nodes(G) }
> card[] = 1
>
> I do not understand the card[] = 1
 >
> 18.6 Extending SPARQL Basic Graph Matching
>
> [Ref: OWL2 semantics]
> ->
> Add an hyperlink ?
>
>
>
> 19.8 Grammar
>
> the the two cases
>
> The rule QuadData is used in INSERT DATA and DELETE DATA must not allow
> variables in the quad patterns.
> ->
> The rule QuadData, used in INSERT DATA and DELETE DATA, must not allow
> variables in the quad patterns.
>
>
Received on Thursday, 28 April 2011 10:10:48 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:46 GMT