W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > July to September 2004

RE: New requirement: disjunction

From: Rob Shearer <Rob.Shearer@networkinference.com>
Date: Tue, 20 Jul 2004 09:16:10 -0700
Message-ID: <CFE388CECDDB1E43AB1F60136BEB4973028109@rome.ad.networkinference.com>
To: "Dan Connolly" <connolly@w3.org>, "Yoshio Fukushige" <fukushige.yoshio@jp.panasonic.com>
Cc: "RDF Data Access Working Group" <public-rdf-dawg@w3.org>, <fuku@w3.org>

> I think clarifying "by the query" to "by the queried graph" is
> worthwhile:
> 
> [[
> The query language must include the capability to restrict 
> matches on a
> queried graph based on a disjunction of graph patterns, at 
> least one of
> which must be satisfied by the queried graph.
> ]]

This issue was immediately noticed at the f2f, and I believe the
requirement we voted on simply dropped the last prepositional phrase:
"...at least one of which must be satisfied."
Received on Tuesday, 20 July 2004 12:18:32 GMT

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