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

agenda: RDF Data Access WG telcon 11 May

From: Dan Connolly <connolly@w3.org>
Date: Mon, 10 May 2004 10:55:02 -0500
To: RDF Data Access Working Group <public-rdf-dawg@w3.org>
Message-Id: <1084204502.32020.339.camel@dirk>

1. convene, take roll, review record, agenda

 RDF Data Access Working Group
 http://www.w3.org/2001/sw/DataAccess/
 Tuesdays
 10:30am-12:30pm/14:30-16:30 UTC
 Zakim Bridge tel:+1.617.761.6200 , conference 7333 ("RDFD")
 http://www.w3.org/Guide/1998/08/teleconference-calendar#s_1343
 supplementary chat: irc://irc.w3.org:6665/dawg
	log to appear: http://www.w3.org/2004/05/11-dawg-irc

scribe: Dave Beckett

Roll call: see WG membership at
  http://www.w3.org/2001/sw/DataAccess/#who

PROPOSED: to accept

 Minutes of RDF DAWG telcon 2004-05-04 for review
 From: Rob Shearer <Rob.Shearer@networkinference.com>
 Date: Fri, 7 May 2004 11:05:04 -0700

http://lists.w3.org/Archives/Public/public-rdf-dawg/2004AprJun/0330.html

as a true record of our last meeting.

next telcon is scheduled for Tue, 18 Apr.
  NOTE WELL: chair has a conflict
  scribe volunteer?


misc actions from Amsterdam:
ACTION DanC: inform the TAG of the conflict between sec13.9 of the HTTP
spec and TAG's recommendation on issue 7

misc actions from 4May:
ACTION: EricP to set up a public comment list, and to work with DanC to
choose a name for it

Comments on today's agenda?
Are there specific proposals for requirements that I've missed?
especially any where email traffic shows at least some support
and no outstanding objections?



2. Requirements: 3.1 Multi-edged Paths

DONE: Andy Seaborne and Jean-François to rewrite 3.1
http://lists.w3.org/Archives/Public/public-rdf-dawg/2004AprJun/0248.html

proposal0248: [[
3.1 Multiple RDF triple matching

The query langauge must include the capability to restrict matches on the
RDF graph by providing more than one RDF triple pattern to be satisified in
one query.
]]

proposal0261: [[
  The query language must include the capability to restrict matches
  by graph pattern on the queried graph by providing a graph pattern.
  The graph pattern may consist of one, two or more RDF triple patterns,
  to be satisfied in one query.
]]


proposal0269: [[
The query language must include the capability to restrict matches
on a queried graph by providing a graph pattern, which may
consist of one or more RDF triple patterns, to be satisfied in one    
query. 
]]


3. Requirement 3.2 Variable Binding Results

DONE: Pat Hayes to summarize query/binding experience from DQL
 summary of OWL-QL experiences
http://lists.w3.org/Archives/Public/public-rdf-dawg/2004AprJun/0245.html

I'd like Pat to talk thru this message a bit.


4. Requirement 3.4 Subgraph Results

DONE: EricP to write up implemention experience for 3.4
http://lists.w3.org/Archives/Public/public-rdf-dawg/2004AprJun/0260.html

ACTION: Steve Harris to express objections to 3.4


5. Use Cases Draft
  http://www.w3.org/2001/sw/DataAccess/UseCases
  v 1.39 or better

ACTION: RobS to generate some RDF for the use cases

ACTION: Kendall and Alberto to work on section 5.1.3 of this document


6. additional use cases

ACTION DaveB: write up this educational metadata UC

ACTION Yoshio: to write up "Kate finds an article and wants to find
related programs..."

Browsing Example - tell me about X, ACTION Steve Harris

Bandwidth Efficiency - bytesize of resultset, ACTION SteveH

ACTION Janne: write a use case to motivate the requirement of having
queries written in RDF. (WITHDRAWN?)


7. Test materials

ACTION SteveH: to draft and maintain a list of test sketch cases,
including x < y, x < 18.



-- 
Dan Connolly, W3C http://www.w3.org/People/Connolly/
see you at the WWW2004 in NY 15-21 May?
Received on Monday, 10 May 2004 11:55:18 GMT

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