13:00:19 RRSAgent has joined #ldp 13:00:19 logging to http://www.w3.org/2014/04/15-ldp-irc 13:00:21 RRSAgent, make logs public 13:00:21 Zakim has joined #ldp 13:00:23 Zakim, this will be LDP 13:00:23 I do not see a conference matching that name scheduled within the next hour, trackbot 13:00:24 Meeting: Linked Data Platform (LDP) Working Group Teleconference 13:00:24 Date: 15 April 2014 13:00:52 zakim, room for 10 for 10 hours 13:00:52 I don't understand 'room for 10 for 10 hours', Arnaud 13:01:12 zakim, room for 10 for 10h 13:01:12 I don't understand 'room for 10 for 10h', Arnaud 13:01:20 deiu has joined #ldp 13:01:58 zakim, room for 10 for 600 minutes 13:01:58 I don't understand 'room for 10 for 600 minutes', Arnaud 13:03:32 sandro has joined #ldp 13:03:50 Zakim, room for 10 people for 600 minutes? 13:03:51 ok, sandro; conference Team_(ldp)13:03Z scheduled with code 26631 (CONF1) for 600 minutes until 2303Z 13:04:26 Team_(ldp)13:03Z has now started 13:04:33 + +1.617.715.aaaa 13:05:20 guys, I cannot be all time connected by phone, at least today 13:05:26 so ping me if you need somethign from me 13:05:43 hi everyone 13:05:44 I'll try to connect for tomorrow and the test cases slot 13:05:50 we're still getting set up here 13:06:23 ok 13:07:18 we forgot to reserve the phone bridge so the code is 26631 instead of the usual ldpwg 13:07:35 Ashok has joined #ldp 13:07:49 Arnaud has changed the topic to: Teleconference code is 26631 (CONF1)!! LDP WG: http://www.w3.org/2012/ldp - next agenda: https://www.w3.org/2012/ldp/wiki/F2F5#Agenda 13:10:20 betehess has joined #ldp 13:14:11 JohnArwe has joined #ldp 13:14:34 video link for meeting -- http://bit.ly/swa-hangout 13:16:24 scribenick: Alexandre 13:16:31 scribenick: betehess 13:16:37 scribe: Alexandre 13:16:56 roger has joined #ldp 13:19:00 roger has joined #ldp 13:19:46 Arnaud: got a request from nandana to move the Primer 13:20:06 ... so I swapped Primer and BP 13:20:26 ... let's get started 13:20:29 ... want to talk where we are 13:20:35 ... finished 2 LC period 13:20:41 ... few comments, not too many 13:20:48 ... we have to dispose of them properly 13:21:09 ... be prepared for the review w/ w3c management for later phases 13:21:15 ... comments are part of the review 13:21:26 ... good to have some comments: people have looked at it! 13:21:49 ... we do best effort to satisfy the comments 13:21:55 ... a bit confused with the tracker 13:22:10 ... I forward the comments to the list but they don't appear in the tracker 13:22:47 ... need a plan for addressing the comments before leaving the meeting 13:22:55 ... I was at WWW last week 13:23:06 ... *many* people came to me to ask me the status of the spec 13:23:15 ... the community is waiting for me 13:23:26 s/for me/for it/ 13:23:38 ... we split the spec 13:23:46 ... and make sure everybody wants it 13:24:07 ... UC&R was republished as a Notee 13:24:12 s/Notee/Note/ 13:24:26 ... we won't talk about it unless you ask 13:24:37 ... test suite and validator will be important for CR 13:24:42 ... so we'll spend time on it 13:24:51 ... we have to show the spec can be implemented 13:25:10 ... Access Control WG Note: there will be 1 hour 13:25:17 ... it was part of the Charter 13:25:27 ... we may not do it, just have to explain 13:25:54 ... BP&R was not in charter but we have moved some stuff there 13:26:01 ... Primer is important 13:26:15 ... part of the feedback I had was about readibility of spec 13:26:27 ... so the Primer is key 13:26:33 ... and then, what's next? 13:26:40 nmihindu has joined #ldp 13:26:56 ... we had a request from W3C to know if we'll meet at TPAC 13:27:05 ... end of WG supposed to be in June 13:27:12 ... don't we'll be done in June 13:27:18 ... at best, we're in PR 13:27:29 ... which means we're pretty much done 13:27:45 ... but we have to stick around, (like 2 months) just in case there are comments 13:27:53 ... extension would be under same charter 13:28:02 ... but the group may want to continue the work 13:28:10 ... then there would be a _new_ charter 13:28:32 ... we have a page for wishlist for LDP Next 13:28:32 TallTed has joined #ldp 13:28:42 ... so we'll discuss what we want 13:28:58 ... W3C needs to allocate resources, based on what's in the charter 13:29:12 ... succeeding with the first charter is the best way to get another one ;-) 13:29:36 ... last but not least: Patch format 13:29:37 Zakim, what's the code? 13:29:37 the conference code is 26631 (tel:+1.617.761.6200 sip:zakim@voip.w3.org), nmihindu 13:29:46 ... the spec says you have to use Patch 13:29:51 ... but we don't say how 13:30:00 ... we created a separate ML 13:30:07 ... had some mails, but not much 13:30:17 ... hope we can have a resultion on that 13:30:28 +??P1 13:30:38 Zakim, ??P1 is me 13:30:38 +nmihindu; got it 13:30:59 thank you very much 13:31:02 SteveS: ericP will participate to the Patch conversation 13:31:04 if you're speaking nandana, we're not hearing you, fyi 13:31:12 from F2F5 wiki: “ericP (though I can attend occasionally, possibly for patch)” 13:31:39 JohnArwe, I am trying to fix the mic, please move on. 13:31:42 Arnaud: people were interested in interop testing 13:31:50 ... don't know how feasible it is 13:31:58 ... last afternoon is dedicated in doing that 13:32:08 ... not sure how I'll make it happen 13:32:23 ... if there is any prep before we do it, please let me know 13:32:51 codyburleson has joined #ldp 13:33:26 ... based on the discussions we'll have, I won't hesitate to shrink/extend time on some subjects 13:33:56 sandro: btw, the catering is provided by @@ 13:34:02 s/@@/QCRI/ 13:34:29 Arnaud: thank you 13:34:43 ... hard to know how much time we'll need 13:35:14 SteveS: was wondering haw many people we'll have implementations 13:35:26 Arnaud: around 4? 13:35:35 TallTed: all servers I guess 13:35:58 deiu: have a client as well 13:36:09 TallTed: curl is test suite, it's not interop 13:36:18 sandro: it's an alternative 13:36:25 Arnaud: ok I see the point 13:36:53 TallTed: I don't consider curl as an LDP client 13:37:14 Arnaud: ok, let's jsut call it "testing" 13:37:33 ... interop is reached when you can replace a component with another one 13:37:47 topic: LDP Specification 13:38:33 http://www.w3.org/TR/2014/WD-ldp-20140311/ 13:39:49 http://www.w3.org/2006/02/lc-comments-tracker/55082/ 13:40:02 http://www.w3.org/TR/2014/WD-ldp-20140311/ 13:40:32 Do we need to engage the teleconference bridge? Right now, +1-617-761-6200, conf. code 53794#, returns "This passcode is not valid." 13:41:00 codyburleson... 13:41:04 Zakim, what is the code? 13:41:04 the conference code is 26631 (tel:+1.617.761.6200 sip:zakim@voip.w3.org), sandro 13:41:41 codyburleson, code is 26631 for today, and there's a video-only link http://bit.ly/swa-hangout 13:41:47 Arnaud: trying to figure out how the tracker works 13:42:09 sandro has changed the topic to: Teleconference code is 26631 (CONF1)!! LDP WG: http://www.w3.org/2012/ldp - next agenda: https://www.w3.org/2012/ldp/wiki/F2F5#Agenda VIDEO: http://bit.ly/swa-hangout 13:43:22 +[IPcaller] 13:43:32 Zakim, IPcaller is me. 13:43:32 +codyburleson; got it 13:47:07 Arnaud: there were 2 comments from reto 13:47:15 ... one about multiple named graphs 13:47:21 ... thanks betehess for one! 13:47:28 s/one/that one/ 13:47:35 http://lists.w3.org/Archives/Public/public-ldp-comments/2014Mar/ 13:47:51 ... and then the null relative URI "hack" 13:48:00 ... and then there is an extra one 13:48:05 ... an issue we have to fix 13:48:14 ... brought up by sergio 13:48:29 ... there is a problem with the use of the rel=describedBy header 13:48:34 ... for 2 different things 13:48:52 s/describedBy/describedby/ 13:49:06 MiguelAraCo has joined #ldp 13:52:14 http://lists.w3.org/Archives/Public/public-ldp-wg/2014Mar/0037.html 13:52:32 Zakim, MiguelAraCo is with codyburleson 13:52:32 +MiguelAraCo; got it 13:52:57 Arnaud: has anybody anything to add? 13:53:15 SteveS: had a comment about @@ needing more clarity 13:53:39 Arnaud: people need to forward comments to the list 13:53:43 s/@@/implementation feedback/ 13:53:43 ... so that we can track them 13:54:35 sandro: external comments are still important for reviews 13:54:56 Arnaud: let's agree we have 1 issue and 2 comments 13:55:10 ... and we need to make sure we have done the same for comments from 1st LC 13:55:48 ... timbl's comments are marked as ?? but we are in an ongoing discussion with him 13:56:17 ... mark baker said he's fine with the improvements we made 13:57:15 ... are we in good share re: comments? do we need to do more? 13:58:05 ... note that we haven't had a real answer from timbl 13:58:26 ... and there is a comment not really addressed 13:58:41 sandro: timbl may join us 1 hour, we can ask at this point 13:59:07 ... in good shape? would be good to have more feedbacks from implementers 13:59:14 ... having that by email is better 13:59:37 Arnaud: Q for editors: 13:59:43 http://www.w3.org/2006/02/lc-comments-tracker/55082/ldp/2840 14:00:26 [[ 4.1 "burden of constraints for resource creation" - I feel that phrase needs more explanation ]] 14:00:40 JohnArwe: still part of the spec 14:01:38 TallTed: the question is "what do you mean?" 14:01:47 ... not clear at first read 14:02:39 [ people discussing possible resolutions ] 14:05:22 sandro: how about: how can the server make it easy for the client to create resources? 14:05:32 Arnaud: sounds nice 14:05:40 ... do we agree? 14:05:51 ... with editorial change? 14:06:14 ... would allow us to dispose of that pending comment 14:06:15 +1 14:06:19 +1 14:06:23 +1 14:06:23 +1 14:06:26 ... I don't hear objections 14:06:33 +1 :-) 14:07:31 +1 14:10:16 Arnaud: now we start with the null relative URIs hack comment 14:10:45 +1 14:10:56 ... let's try restate what the issue is 14:11:01 ... when we create a resource 14:11:04 ... we send some RDF 14:11:07 action-137? 14:11:07 action-137 -- Sandro Hawke to Contact yves and erik to make confirm with them that http-wg is okay with this reading of the link context -- due 2014-04-07 -- OPEN 14:11:07 http://www.w3.org/2012/ldp/track/actions/137 14:11:18 ... at that time, we don't know what the url of the resource will be 14:11:23 topic: Null-relative-URI comment 14:11:24 ... so we use the null relative uri 14:11:30 ... and everything is relative to it 14:11:47 ... comment says: doesn't exist in RDF 14:11:57 ... as RDF does not support this notion 14:12:10 ... alternative is the client know the url before posting 14:12:19 ... so there are 2 steps 14:12:33 JohnArwe: there are other solutions 14:12:40 ... could have a placeholder 14:12:51 ... eg using a header to specify a place holder 14:13:16 Arnaud: this was presented as an alternative 14:13:58 sandro: it's not a bnode, it's a node uri 14:14:08 TallTed: it behaves like it 14:14:17 q+ 14:14:51 Ashok: RDF does not have the concept, can we fix it? 14:15:05 sandro: we can use relative graphs, not rdf graphs 14:15:16 Arnaud: hold on 14:15:27 ... this was proposed as alternatives 14:15:51 JohnArwe: you need to specify uri for the placeholder 14:16:26 betehess: then the graphs are not isomorphic 14:17:00 Arnaud: issues is coming from people using libraries without relative uris 14:17:31 ... people claim their tools don't support it 14:17:55 TallTed: if the problem is the library, go fix the library 14:18:03 q+ 14:18:06 RDF doesn't support it 14:18:21 i'd like it to, but RDF is all about absolute URIs 14:18:33 Arnaud: RDF does not support it, my tools don't support it, what can I do? 14:19:07 ... one possible response: LDP uses Turtle, which support rel uris 14:20:05 +ericP 14:20:12 ack betehess 14:20:41 betehess: I reported this issue a long time ago, saying that by changing from RDF mediatypes to something new (eg. application/ld) would help 14:21:07 ... we can add something to the recs, telling the RDF processor to use a special namespace for the relative URIs and then you do the interpretation 14:21:17 ... this is a way to deal with libs that don't support relative URIs 14:21:19 roger has joined #ldp 14:21:23 sandro: I don't understand 14:21:44 ... the client has no way to construct a turtle serialization 14:22:03 new URI scheme! 14:22:16 ... both problems exist, the server has the problem that it cannot properly parse turtle 14:22:24 client uses a uri scheme which is understood to be changed by the server 14:22:39 server, in the worst case, parses twice 14:23:36 Arnaud: several options: either we stick with what we have 14:23:37 could also say that ldp:foo is the base URI 14:23:38 betehess: if you want to actually tell people that it's not exactly RDF we're working with 14:23:44 ... we can create a note on relative graphs 14:23:48 ... or we just leave it as is 14:24:06 ... or we use some placeholder uris that the server can recognize 14:24:23 ... or we give some control to the client to choose their own rel uri 14:24:57 interesting, we could use the slug for that (or some transform for that) 14:26:33 deiu: can't we use the Slug as the placeholder? 14:26:37 OPTION 1: When the client wants to post a graph including self-reference, it MUST use the null-relative URI as the reference to itself. We clarify the spec, etc. 14:26:37 OPTION 2: When the client wants to post a graph including self-reference, it MUST use some magic URL we pick, eg http://www.w3.org/ns/ldp#self 14:26:37 OPTION 3: When the client wants to post a graph including self-reference, it MUST make up some placeholder URI, and tell the server which one it picked using Link: rel=selfReferencePlaceholder 14:26:43 TallTed: should not be an http uri 14:27:04 ... because you don't have control over it, it's a server side thing 14:27:53 the only requirement for the placeholder URI is that it have a sufficient number of '/'s 14:28:04 [discussing sandro's options] 14:30:23 sandro: the client doesn't know the future "this" uri, that's the issue 14:30:30 ... option 1 is what we have in LC right now 14:30:47 Arnaud: then we'd say "sorry, you have to make it work" 14:30:58 ... other options would require to change the spec 14:31:23 sandro: well processing is different 14:32:39 ... we'd need to ask every lib to fix that 14:34:04 TallTed: which side we're putting the burden on: client or server 14:34:24 POST /containers/PeopleAndMovies << { ../foo a foaf:Person } 14:34:38 sandro: we may need a Relative Graph Note 14:34:48 Ashok: would it be helpful to other people? 14:35:02 OPTION 1 is probably the easiest to optimize because the server doesn't ever have to crack potentially normalized IRIs 14:35:38 Arnaud: honestly, I am not really in favor in making new documents: too much effort 14:35:40 A "Relative RDF Graph" is hereby defined as being just like an RDF Graph except that IRIs are allowed to be Relative IRIs, not just Absolute IRIs. 14:36:45 SteveS: there is always a base 14:37:01 ... meaning the client can communicate the base it wanted 14:37:11 ... there is always some base 14:37:30 sandro: what you want is the Turtle serializer to make the graph relative to my own base 14:37:52 jmvanel has joined #ldp 14:38:05 And then we suggest tool makers include this concept in their APIs. EG Turtle serializers should have a way to serialize relative graphs. 14:38:37 sandro: OR, lets just say RDF serializers SHOULD include a base parameter 14:40:26 ericP: betehess and I tried to use Jena back then, had to do some hack 14:40:46 betehess: situation is much better now, a few lines of code to have a proper serializer 14:41:18 sandro: may not speak about the relative graph, just say that we don't know the base 14:41:21 "The POST or PATCH body may have relative IRIs. These IRIs are relative to the final document location. Note: Systems which parse the input document in order to determine the final document location may need to provide a temporary BASE (RFC3896) for parsing, determine the final document location, and parse the input again with that as the BASE 14:41:27 ." 14:41:28 Sandro: Let's NOT use "Relative RDF Graph", but instead use "Deferred-Base RDF Graph Serialization". 14:41:39 q+ 14:42:00 ericP, what are you quoting? 14:42:06 just proposing 14:42:06 ack bete 14:42:16 Arnaud: if we didn't have the LC already, I would push for option 3 14:42:26 but you probably have better text already, sandro 14:42:28 betehess: I think we're just trying to make Reto happy 14:42:37 ... I've always been thinking of relative graphs 14:42:53 ... there is a time when we don't know the URI of the graph 14:43:12 ... the LDP spec says the base URI will be chosen by the LDP container, so I don't see any issue 14:43:27 guys, not sure if you are still dicussing the issue, but rdflib (python has the base for serilizers: http://rdflib.readthedocs.org/en/latest/apidocs/rdflib.plugins.serializers.html, and probably sesame (java) too: 14:43:37 sandro: problem with rel graph as a concept, it means we have something new to be handled by libraries 14:44:15 @sergio are you unsure b/c you're having trouble hearing us/ 14:44:30 betehess: libraries can be fixed today, and we stand to gain a lot more from using relative URIs 14:44:39 JohnArwe: I'm not connected by phone, sorry 14:44:51 i wouldn't call that "fixed". i'd call it "extended". 14:45:09 pretending otherwise will irk the ire of RDF hackers 14:45:46 ah no worries - yes lots of discussion back and forth about value/not of "relative graph" definitions 14:46:38 sandro: the real question is being able to make a serialization to a certain base 14:46:43 sandro: I don't think defining Relative Graph is a good idea, because it will make Jena, etc, think they should define serializers and parsers for this, would be be a waste. 14:46:49 s/to a/relative to a/ 14:47:02 sandro: We want serializers to have a MakeRelativeToThis IRI parameter. 14:47:56 serialize(outputStream, graph, makeRelativeToThis) 14:48:23 and note that servers may need to parse zero, one, or two times, depending on their design. 14:48:24 Arnaud: we have to acknowledge the problem 14:48:32 ... for very reasonable designs. 14:48:54 ... other people said this is a practical way to handle this situation (cygri, dwoods) 14:49:02 TallTed: or rather, we need to be able to tell serializers to make serializations with relative IRIs which refer to that serialization... so s/makeRelativeToThis/makeRelative[ToOutputStream]/ 14:49:49 sandro: we can add the MakeRelativeToThis thing in best practices 14:49:55 stevebattle1112 has joined #ldp 14:50:00 Arnaud: then we don't do anything in the spec? 14:50:13 ... would be reasonable to add something 14:51:10 ... the remark was based on how tools work, based on RDF is defined 14:51:29 sandro: we could link from the spec to uc&r 14:51:46 not to uc&r, to best practices 14:51:47 Ashok: best practices is not normative 14:52:00 Arnaud: sounds like we're getting to an agreement 14:52:10 "For a discussion of implementation issues around the use of relative IRIs during POST operations, see [BP]" 14:52:19 +1 14:52:33 I'll try to provide some practical examples of different libs 14:52:47 great, sergio 14:52:53 PROPOSAL: we stick with the spec, add a pointer to Best Practices, and add an implementation issues relative to this 14:53:19 sandro: it'd be an informative dependency 14:54:04 BP https://dvcs.w3.org/hg/ldpwg/raw-file/default/ldp-bp/ldp-bp.html 14:54:25 Arnaud: errr, BP not published yet 14:54:44 sandro: or we can have a non-normative appendix in main LDP spec 14:55:26 PROPOSAL: We stick with the current null-relative design, and we add a non-normative explanation of how that works, how to do it in some tools, etc, in a footnote, appendix, or (hopefully) BP. 14:55:43 +1 14:55:45 +1 14:55:45 +1 14:55:47 +1 14:55:48 +1 14:55:50 +1 14:55:51 +1 14:55:53 +1 14:55:56 +1 14:55:59 +1 14:55:59 +1 (hope it works) 14:56:10 RESOLVED: We stick with the current null-relative design, and we add a non-normative explanation of how that works, how to do it in some tools, etc, in a footnote, appendix, or (hopefully) BP. 14:56:12 +1 14:56:17 (late xD) 14:56:32 :-) 14:56:33 @ericp, what part do you think might not work? 14:57:11 @JohnArwe, can we claim a media type of text/turtle if we don't know the base at the time of transmission? 14:57:39 i.e. should the client or an intermediary be able to know what graph was actually transmitted? 14:57:45 So using .. is a Wrost-Practice, UNLESS you know how the Server is assiging URIs. 14:59:02 JohnArwe, you see my issue? 14:59:41 could i, as a client, have an automagically filled cache of stuff-i've-told-the-world? 15:00:09 (probably not a show stopper use case, but does illustrate what goes wrong when you cheat on specs) 15:00:17 -ericP 15:11:07 Arnaud: resuming 15:11:33 ... during the discussion, somebody brought the ../ "problem" 15:11:42 ... do we want to allow it? prevent it? 15:12:17 ... what does it know? you don't know where the document will be 15:12:28 q+ 15:13:08 JohnArwe: it cannot be a reliable way to reference the container 15:13:18 Arnaud: or even another resource eg. a sibling 15:13:35 TallTed: sure 15:13:42 ... not necesseraly an issue 15:14:00 ... can have multiple container having multiple paths 15:16:02 zakim, who's talking? 15:16:14 Arnaud, listening for 10 seconds I heard sound from the following: nmihindu (45%), +1.617.715.aaaa (20%) 15:16:23 zakim, mute nmihindu 15:16:23 nmihindu should now be muted 15:16:51 Sorry. I thought I was already muted. 15:18:09 JohnArwe: interop could be limited 15:18:45 sandro: the ../ semantics is implied because of other specs 15:19:39 Arnaud: do we want to say something about it in the spec? 15:20:05 ... oh, the ../ issue was brought by cygri 15:20:16 http://lists.w3.org/Archives/Public/public-ldp/2014Mar/0051.html 15:20:47 ... (may be discussed elsewhere as well) 15:21:00 [[ 15:21:00 Because otherwise, it’ll be even less clear what “/“ or “/foo” or “..” refer to, as it’s unclear whether they will be resolved against your hack URI, or the container URI, or the new item URI. 15:21:00 ]] 15:23:02 JohnArwe: rel uris is application specific 15:24:04 sandro: so the question is about base uri, not just null uri 15:24:11 ... the spec is already good 15:24:27 4.2.1.5 LDP servers MUST assign the default base-URI for [RFC3987] relative-URI resolution to be the HTTP Request-URI when the resource already exists, and to the URI of the created resource when the request results in the creation of a new resource. 15:24:46 SteveS: the spec is clear 15:24:54 ... BP might help explaining further 15:25:07 Arnaud: so what are we doing? nothing to do? 15:25:15 ... add something in BP? 15:25:47 "It follows from this definition that use of /../ and other non-null relative URI constructs during POST has application-dependent results" 15:26:18 Ashok has joined #ldp 15:26:25 JohnArwe: it's not ill-defined but it may limit interop 15:26:32 betehess: I'd need an example where it limits interop 15:29:27 betehess: it's not application or implementation specific. the spec already says it's relative to the base uri, always defined in LDP, even during POST 15:29:29 "It follows from this definition that use of /../ and other non-null relative URI constructs during POST will cause the content to be referring to resources in a manner the client will not, in general, be able to predict." 15:29:42 ... but nobody can rely on it to refer to a parent or sibling 15:31:10 Arnaud: people presumed to know where the going to land in a POST and may use ../ in consequence 15:31:19 TallTed: why do we presume people will do that? 15:31:29 SteveS: we may handled that in BP 15:31:54 Arnaud: it's just somebody referred to that, would like to be able to point people at an good answer 15:32:02 q? 15:32:03 q- 15:32:49 roger: people will want to speak about hierarchy and may want to use ../ and stuff like that 15:32:57 "Other non-null relative URI constructs may not refer to the user's anticipated resource, due to variability in implementation and/or deployment. Tread with caution. Here be dragons." 15:33:00 Arnaud: let me make a proposal 15:33:13 roger, yes https://dvcs.w3.org/hg/ldpwg/raw-file/default/ldp-bp/ldp-bp.html#represent-container-membership-with-hierarchical-uris 15:33:25 "It follows from this definition /../ URLs should not be used in POSTed content unless the client has additional information about IRIs are assigned." 15:33:45 ... we should agree to add something in the BP doc about the danger of POSTing docs using rel uris 15:35:37 Add it BP that it follows from the specs that /../ URLs should not be used in POSTed content unless the client has additional information about IRIs are assigned. 15:35:50 deiu: you should never try to refer to a uri that will exist later 15:36:10 JohnArwe: we had a proposal to handle that in the BP doc 15:36:34 PROPOSED: Add it BP that it follows from the specs that /../ URLs should not be used in POSTed content unless the client has additional information about IRIs are assigned. 15:36:42 ... and we nail down the document 15:36:48 PROPOSED: Add it BP that it follows from the specs that /../ URLs should not be used in POSTed content unless the client has additional information about how IRIs are assigned. 15:37:06 s/Add it BP/Add to BP/ 15:37:06 PROPOSED: Add it BP that it follows from the specs that /../ URLs should not be used in POSTed content unless the client has additional information about how IRIs are assigned (by that particular server). 15:37:10 +1 15:37:12 +../1 15:37:17 +1 15:37:18 +1 15:37:27 +1 15:38:17 sandro: we can have an LDP extension using information that uris will be right under the container 15:39:24 +0 15:39:33 -1 15:39:39 betehess: i don't want people to consider the possibility that they MIGHT know more about how URIs are assigned by servers. 15:40:07 PROPOSED: Add to BP that it follows from the specs that using /../ URLs in POSTed content may have unpredictable results. 15:40:22 PROPOSED: Add it BP that it follows from the specs that /../ URLs should not be used in POSTed content 15:41:09 +1 15:41:10 +0 15:41:14 voting on sandro's... 15:41:21 +0 15:41:28 +0 (can leave with it, strongly prefer TallTed's wording) 15:41:33 +0.5 15:41:34 +1 15:41:38 +0 15:41:44 +0.5 15:41:53 (we're currently voting on sandro's proposal) 15:42:19 0 15:42:20 +0.5 (think a general section and discussion in BP on this general topic is good) 15:42:33 PROPOSED: Add to BP that it follows from the specs that using /../ URLs in POSTed content may have unpredictable results. 15:42:41 +1 15:42:44 +1 15:42:45 +1 15:42:45 +0.5 15:42:49 +0 15:42:51 +1 15:42:56 -1 15:42:57 +1 15:43:06 +0 15:43:26 +0.5 (think a general section and discussion in BP on this general topic is good) 15:43:33 codyburleson - can you explain the -1? 15:43:50 I just am uncomfortable with ../ in graphs 15:43:50 zakim, who's on the phone? 15:43:50 On the phone I see +1.617.715.aaaa, nmihindu (muted), codyburleson 15:43:51 codyburleson has codyburleson, MiguelAraCo 15:43:52 period 15:44:11 ok, thanks 15:44:11 Arnaud: then I think we'll go with sandro's proposal 15:44:16 RESOLVED: Add it BP that it follows from the specs that /../ URLs should not be used in POSTed content 15:44:18 ... resolved! 15:44:38 +q 15:44:39 ... should take care of all relative uris 15:45:04 ack codyburleson 15:45:54 Arnaud: that's the power you have: -1 is blocking 15:47:31 ... that's how concensus should work! 15:47:42 ... let's move to next topic: named graphs 15:47:53 http://lists.w3.org/Archives/Public/public-ldp-comments/2014Mar/0000.html 15:48:13 ... we added the sentence in the spec lately 15:48:49 .. in 5.2.3.4 [[ The created resource can be thought of as an RDF named graph ]] 15:49:10 ... some people thought it was a great improvement 15:49:25 ... but other didn't like it, prefer to have one big graph 15:49:42 -q 15:50:30 betehess: has anybody said anything about the default graph as union of named graphs? 15:50:35 sandro: don't think so 15:51:20 Arnaud: that's where I think the sparql store protocol does a good job 15:52:34 s/that's where I think the sparql store protocol does a good job/the sparql protocol does make use of named graphs/ 15:53:00 sandro: named graphs should rely on defining a dataset, which is not defiend 15:54:23 TallTed: the spec speaks about a preference to use a syntax supporting named graphs 15:54:24 q+ 15:54:42 timbl has joined #ldp 15:55:04 Arnaud: also related to inlining 15:55:15 ack betehess 15:55:56 betehess: the reason I introduced the named graph discussion is that there are two things to consider: inlining and named graphs are very related 15:56:00 TimBL: historically lots of discussion about named graphs, what they should be, etc. when you bring in that term you tend to raise a lot of questions 15:56:06 ... where can I look for info if I don't know where it is 15:56:39 ... if I want to enable SPARQL for an LDPC, then how do I know which resources are members of a container 15:57:00 sandro: that can be part of an extension 15:57:27 betehess: the triple in question is ldpContains 15:57:50 ... basically, you are able to point to the named graphs so therefore you can explore the container 15:58:14 sandro: you can't backhand into SPARQL, LDP doesn't say that LDP is a dataset 15:58:25 ... there is no way to get to SPARQL from LDP 15:58:40 betehess: how do you define dataset? 15:58:41 s/TallTed: the spec speaks about a preference to use a syntax supporting named graphs/TallTed: the spec speaks about a preference to use a syntax supporting named graphs when `providing [a] resource and supporting containers in a single response representation.`/ 15:58:53 sandro: it's what you have in your SPARQL database 16:00:23 ... LDP doesn't care about SPARQL, so it's out of scope 16:00:34 betehess: nothing tells me today where the triples live 16:04:51 JohnArwe: we never said that implementations had to rely on named graphs 16:05:13 sandro: just saying that the specification is not properly done when it comes to named graphs 16:05:34 ... I'd like to be able to do a GET with trig 16:05:53 sandro: 2 options: 16:06:09 ... 1. keep spec as is, and say we don't prevent him to have a one graph implementation 16:06:24 ... 2. we remove mentions of named graphs in the spec, and make him happy 16:06:31 sandro: Let's remove all usage of "Named Graphs" terminology in the spec, since we're not fully defining how it's all supposed to work. 16:06:40 TallTed: not forbidden use of trig, it's still possible to return it 16:06:47 q+ 16:06:49 ... if not supported, just return Turtle 16:06:57 ... options are still there 16:07:05 ack timbl 16:07:07 Arnaud: are you saying you're speaking spec as is? 16:07:39 timbl: conneg must be used for things that are the same 16:07:57 ... so Turtle is not enough to return named graphs 16:08:25 TallTed: we said the server can return more than you ask for 16:08:30 ... so if you ask for trig, you just get more informations 16:10:07 timbl: would bad idea to return trig without saying it's not a full representation of the resource 16:10:14 ... maybe a different http code? 16:10:30 ... in LDP thing, the conceptual thing is a graph 16:10:58 sandro: in http, caching allows to use headers for variance 16:11:34 ... could use link headers, like Prefer 16:12:24 ... meta point is: it's interesting work outside of this WG 16:12:34 ... let's not prejudge what the issue is 16:13:28 Arnaud: maybe we can remove it? 16:14:15 ... in terminology section, we have LDP-RS 16:14:34 sandro: can say it's a pair or IRI and graph in some dataset, but dataset is not defined 16:16:10 from RDF 1.1 Concepts -- "We informally use the term RDF source to refer to a persistent yet mutable source or container of RDF graphs. An RDF source is a resource that may be said to have a state that can change over time. A snapshot of the state can be expressed as an RDF graph. For example, any web document that has an RDF-bearing representation may be considered an RDF source. Like all resources, RDF sources may be named with 16:16:10 IRIs and therefore described in other RDF graphs." 16:16:25 ... was brought up by betehess saying that we have to clarify the spec 16:16:49 SteveS: timbl said we could just remove "named" from "named graph" because it is what it is 16:17:26 sandro: the problem is that it contradicts the RDF spec 16:17:33 Arnaud: yeah, it's a G-Box 16:18:44 timbl: the state of the resource is graph 16:18:50 s/graph/a graph/ 16:18:59 Arnaud: so removing "named" would work then 16:19:05 The State of the Resource is a Graph, but the Resource itself is not a Graph. 16:19:19 yes 16:19:34 ... the spec already speaks about spec 16:19:38 s/spec/state/ 16:19:54 ... the spec already speaks about state 16:20:15 +1 An LDPR whose state is fully represented by an RDF Graph. 16:20:19 ... then let's go to Examples 16:20:56 ... we may remove the paragraph about syntax and multiple named graphs 16:21:29 timbl: what's nice about LDP spec is that it defines solid things 16:22:08 An LDPR’s state is an RDF Graph and is fully represented in RDF. See also the term RDF Source from [rdf11-concepts]. 16:23:25 Arnaud: so the question from SteveS was to consider moving that paragraph to BP 16:23:30 ... I think it's fine 16:24:00 ... we can remove the mention from 5.2.3.4 16:24:05 ... just a hint here 16:24:12 ... same for 5.2.4.2 16:24:15 ... and that's it 16:25:27 PROPOSED: removed references to named graphs: remove "named" in terminology section, remove paragraph in examples, remove sentence in section 5.2.34 and 5.2.4.2 16:25:39 PROPOSED: remove references to named graphs: remove "named" in terminology section, remove paragraph in examples, remove sentence in section 5.2.34 and 5.2.4.2 16:25:50 PROPOSED: remove references to named graphs: remove "named" in terminology section, remove paragraph in examples, remove sentence in section 5.2.3.4 and 5.2.4.2 16:25:54 +1 16:26:01 +1 16:26:03 +0.99 16:26:03 +1 16:26:07 +1 16:26:08 +1 16:26:15 +1 16:26:17 +1 16:26:30 +1 16:26:41 RESOLVED: remove references to named graphs: remove "named" in terminology section, remove paragraph in examples, remove sentence in section 5.2.3.4 and 5.2.4.2 16:27:13 break until 1:15 16:27:25 -codyburleson 16:27:27 -nmihindu 16:46:54 timbl has joined #ldp 16:55:23 jmvanel has joined #ldp 17:15:36 SteveS has joined #ldp 17:19:23 scribenick: deiu 17:19:23 http://lists.w3.org/Archives/Public/public-ldp-wg/2014Mar/0037.html 17:19:24 scribe: Andrei 17:19:51 topic: describedby 17:20:26 Arnaud: when we POST a non-RDF source, the server may create an additional RDF source (with the meta data for the non-RDF source) 17:20:43 ... to do that, we use describedBy 17:21:30 s/describedBy/rel=describedby 17:22:05 ... Sergio raised the question about a possible conflict with describedBy 17:22:41 sandro: we should say what happens when there are two headers 17:22:56 Arnaud: there is more than one thing that describes the resource, there's nothing wrong with that 17:23:30 sandro: basically they are all true, so the best practice would be to merge 17:23:53 Arnaud: for a non-RDF you wouldn't have a shape 17:24:06 ... you have a piece of XML, meta data and a schema 17:24:23 ... you need to follow the link to find what kind of information resource it is 17:24:54 ... there is no way to guarantee that there will only be one 17:25:16 sandro: if it's something very specific, then you should sub-type the property 17:25:51 sandro: we can change rel=describedby to rel=serverconstraints 17:26:26 Arnaud: resource shape was submitted to W3C 17:26:36 ... I expect discussion to start soon 17:27:07 ... if I have a shape, I MUST use the rel=describedby link 17:27:37 sandro: I would like to take this out 17:27:52 ... 4.2.1.6 that is 17:28:11 ... if the resource shape spec says something about this, then we don't need to have it in the LDP spec 17:29:29 Arnaud: your client can figure out the constraints by following the link 17:29:50 sandro: I agree it works to follow the link and do conneg 17:30:37 +[IPcaller] 17:30:49 Zakim, IPcaller is me. 17:30:49 +codyburleson; got it 17:30:56 Arnaud: you might end up using two Link headers, it's not a big deal 17:31:08 ... one Link might become deprecated at some point 17:31:54 TallTed: if you fail and don't say anything about the reason, then it's bad (as Timbl said) 17:32:42 sandro: unless there is something a client could do, why have the server provide the reason to the client 17:33:43 Arnaud: we can either drop or keep the Link, but if we keep it, what rel value are we going to use? 17:34:54 OPTION 1: Use rel=describedby for as many things at once as needed; they are all types of description 17:34:54 OPTION 2: Use different rel= arguments for each different type of description the client might find useful 17:35:35 Arnaud: Sergio said the "possible" conflict, when he referred to rel=describedby, and the one that is linking the binary resource to the RDF meta resource 17:36:16 JohnArwe: if you read the spec carefully, then you would see there is no conflict 17:36:28 ... some people may have a problem, others may not 17:36:38 sandro: how do you decide what is meta data and what is data? 17:37:27 ... these are the most important bits of the data, I don't want to have another request to get the meta data 17:38:31 Arnaud: there's a tradeoff of reusing existing terms, but sometimes those terms are used to refer to different things 17:39:07 sandro: the resource shape will say "this kind of shape is allowed here" 17:39:18 { :thing rel=describedby :a . :a a ldp:resourceShape } 17:39:57 Arnaud: the spec is not really broken, we can live with the way it is so 17:40:03 I kind of think OPTION 2 is better, long term, but OPTION 1 is fine, and in the spec already. 17:40:46 Arnaud: the only downside is that if we come up with a better way, we still have to support the old rel=describedby link 17:40:49 Arnaud: worst case, we need to send around extra describedby links 17:40:53 ... it's not a big problem 17:42:37 PROPOSED: we'll use rel=describedby as in the spec currently, for both metadata on binary resources, and expressiing constraints during server error messages. These are both descriptions and there may be lots of other kinds in the future, too. 17:43:02 +0 (don't care/fine either way) 17:43:03 +1 17:43:04 +0.9 17:43:07 +0 17:43:08 +1 17:43:10 +0 17:43:11 +1 17:43:27 +0 17:43:52 RESOLVED: we'll use rel=describedby as in the spec currently, for both metadata on binary resources, and expressiing constraints during server error messages. These are both descriptions and there may be lots of other kinds in the future, too. 17:44:11 http://www.w3.org/TR/powder-dr/#assoc-linking 17:45:18 http://www.w3.org/2007/powder/powder-errata 17:45:48 within errata, search on: Misalignment of definition of wdrs:describedby cf. @rel describedby 17:46:00 better -- http://www.w3.org/2007/powder/powder-errata#describedby 17:48:32 [people talking about defining describedby or linking to the right definition] 17:49:30 Do we keep this: We define the RDF property wdrs:describedby, the meaning of which is identical to the describedby link relationship type defined above so that: 17:49:51 ... if we're defining a spec for rel=describedby. 17:50:21 sandro: I'm suggesting we change anything that would affect implementations, just editorially 17:51:19 ... we can defined describedby the way we want it, and still keep the link header definition from powder 17:51:26 s/defined/define 17:51:47 timbl has joined #ldp 17:52:03 +??P0 17:52:08 Ashok has joined #ldp 17:52:17 The relationship A 'describedby' B asserts that resource B provides a description of resource A. 17:52:17 Zakim, ??P0 is me 17:52:17 +nmihindu; got it 17:52:28 Zakim, mute me 17:52:28 nmihindu should now be muted 17:52:58 ...that's the normative definition of it based on the content of the errata linked to above 17:53:13 Arnaud: the reference points to the powder spec which has a bad definition 17:53:26 sandro: the textual definition from Appendix D is fine 17:53:55 ... unfortunately iana links to a different part of the spec 17:54:22 http://www.w3.org/2007/05/powder-s.rdf#describedby 17:54:31 sandro: Basically, http://www.w3.org/TR/powder-dr/#appD is fine. 17:54:31 http://www.w3.org/TR/powder-dr/#assoc-linking 17:54:39 http://www.w3.org/TR/powder-dr/#semlink 17:54:43 ...that's the link from the erratum to the RDF Schema document 17:54:48 Arnaud: so we are good from an LDP perspective, it's just the references that need to be fixed 17:56:19 http://www.w3.org/2010/08/26-maintenance.html 17:56:57 sandro: can't we have LDP just repeat the same definition, instead of using the link from iana to powder 17:58:40 ... basically copy the definition from Appendix D into LDP 17:59:30 PROPOSED: Copy http://www.w3.org/TR/powder-dr/#appD, more or less, to LDP, so that the link registry can avoid the powder errata situation, pending confirmation from IETF liaison that this is reasonable 18:00:00 +1 18:00:02 +1 18:00:06 +0.5 18:00:10 +0 18:00:11 +1 18:00:12 +0 18:00:23 +0.5 18:00:24 1 18:00:37 RESOLVED: Copy http://www.w3.org/TR/powder-dr/#appD, more or less, to LDP, so that the link registry can avoid the powder errata situation, pending confirmation from IETF liaison that this is reasonable 18:00:39 (the "more or less" is meant to cover the fact that the link will of course be different., as will the description of the process.) 18:00:54 action: sandro follow up on resolution about moving rel=describedby text 18:01:00 Created ACTION-138 - Follow up on resolution about moving rel=describedby text [on Sandro Hawke - due 2014-04-22]. 18:03:06 Arnaud: let's talk about the LDP spec now, what do we need to move forward 18:03:14 ... what does it mean to go to CR? 18:03:25 ... it's an explicit call for feedback 18:03:30 Process stuff http://www.w3.org/2005/10/Process-20051014/tr#transition-reqs 18:03:59 ... as part of the process we have to define our exit criteria for CR 18:04:24 Ashok: you want to go to CR on the spec (and only on the spec), no paging spec 18:04:47 ... paging is really important, so is patch 18:05:28 Arnaud: at this point the spec is what it is, but as soon as we make progress on paging/patch we can update the spec and/or point to those documents 18:05:46 Ashok: paging is a fundamental part of our scope 18:06:10 ... it is one of the two big questions, so can we go to CR with only half the work? 18:06:25 Arnaud: we made a decision to move paging to the side for now 18:06:41 ... I agree that is is on the charter and we will dedicate time to it 18:07:42 timbl: paging is useful but patch is more vital 18:08:14 Arnaud: paging is still on the table, we're not dropping it 18:08:58 q+ ask about current “features at risk” in draft 18:09:16 ack SteveS 18:09:37 Arnaud: it would be better to have something (LDP) even without paging, as opposed to not making it to CR at all due to paging 18:10:41 Arnaud: we can delay Accept-Post 18:10:54 ... we're waiting on progress from the IETF 18:11:25 ... we'll carry both features to CR for now 18:11:42 ... CR is open-ended, we don't exit until we meet the criteria 18:12:25 ... going back to the CR discussion now 18:12:49 sandro: the exit criteria is about either having two implementations that pass every test, or every test is passed by at least two implementations 18:13:46 s/is/could be/ 18:16:25 Arnaud: some parts of the spec are difficult to test (i.e. MUST vs SHOULD) 18:17:40 sandro: those are useful tests but they are not required for CR exit 18:18:31 related section on non-testable parts in test suite document -> https://dvcs.w3.org/hg/ldpwg/raw-file/tip/Test%20Cases/LDP%20Test%20Cases.html#test-suite-coverage 18:18:48 timbl: test suits should be public, even though W3C does trust the spec implementors 18:19:49 We are implementing - with goal for Q3. So, we will have a lot of the internals within a month or two. 18:19:50 Arnaud, every test is passed by at least two implementations seems to be the better criteria 18:19:53 sandro: Are your implementations expecting to be feature-complete for LDP? 18:20:10 Arnaud: let's go around the table to see who plans on implementing it 18:21:00 [around 4-5 people] 18:21:16 raised hands from: roger, steve, andrei, alexandre 18:21:43 ... and Oracle 18:21:49 roger: server and client library, focus on direct and indirect containers, written in Scala, not open source 18:22:16 s/alexandre/alexandre, TallTed/ 18:23:30 SteveS: a simple reference server, a thin layer to prove the entire spec (in java) 18:23:46 SteveS: a number of impls, including a simple reference server (jaxrs + jena), supporting everything in LDP, Open Source (Eclipse) 18:23:46 nmihindu: we will have one implementation for the ALM iStack project from UPM http://www.centeropenmiddleware.com/news/overviewofthefirstyearofthealmistackproject and a variant of that combined with R2RML http://oeg-dev.dia.fi.upm.es/morph-ldp/. We plan to open source our implementation as soon as we figure out some bureaucratic stuff. 18:24:31 SteveS: products at their own pace 18:25:37 andrei: open source server, personal data store, in PHP; working on another one in go. 18:25:59 andrei: only basic containers. 18:26:27 andrei: also client (cimba), uses basic containers 18:26:40 nmihindu: in ALM iStack, we might not support all the features in the spec thought for the first version. 18:26:41 betehess: Scala, supports basic containers 18:28:18 SteveS: indirectContainers is planned, but not done 18:28:34 sandro: Don't implement it just for CR. Implement it if your users want it. 18:29:07 TallTed: we are working on an implementation (full featured) but we don't have an ETA 18:29:38 TallTed: Working on an implementation. I don't have ETA. Probably full features, client and servers. At least virtuoso engine able to act as client and server. 18:30:02 Ashok: we've started working on an implementation 18:30:11 Ashok: We might have two. Just starting, probably not ready in the 2-3 month timeframe. 18:31:24 zakim, who is on the call? 18:31:24 On the phone I see +1.617.715.aaaa, codyburleson, nmihindu (muted) 18:31:33 s/2-3/3-6/ 18:31:44 Apache Marmotta which Sergio et al. are working on. 18:32:27 roger has joined #ldp 18:32:28 http://wiki.apache.org/marmotta/LDPImplementationReport/2014-03-11 18:38:21 sandro: I think at some point we'll have a much better, elegant thing for what DirectContainer and IndirectContainer do. But I'm okay with us proceeding with including them, since we don't have those elegant things yet. 18:41:35 Arnaud: let's get back to the exit criteria 18:41:48 arnaud: I think we're in a fairly healthy situation on implementations 18:42:57 Arnaud: each feature of LDP must be implemented by at least 2 implementations 18:43:15 ... we rely on people making a statement about it, say whether or not they have implemented it 18:43:39 Each Feature and Test has been implementation by at least two independent implementations 18:43:57 s/been implementation/been implemented/ 18:44:14 PROPOSED: define exit criteria as: Each Feature and Test has been implementation by at least two independent implementations 18:45:03 Arnaud has joined #ldp 18:45:21 Wouldn't 3 be better than 2, so that there can be a majority on one side of any issue rather than just 1 vs 1? 18:45:47 PROPOSED: Define exit criterial: Each feature implemented and each test passed by at least two independent implementations 18:46:12 OK 18:46:33 Arnaud: codyburleson we don't do majority -- if there's a disagreement we work it out, and come to consensus. 18:46:53 +1 sounds good 18:46:59 +1 18:47:00 +1 18:47:03 +1 18:47:13 +1 18:47:35 +1 but of course the details depend on the checklist of fatures and the test suite 18:48:12 RESOLVED: Define exit criterial: Each feature implemented and each test passed by at least two independent implementations 18:48:55 Arnaud: let's talk about the BP&G 18:49:08 Status: 18:49:17 topic: Best Practice 18:49:30 All BPs in original wiki doc have been added (and words refined). 18:49:47 TO DO: Update to reflect new revisions in spec; specifically: containe rtypes and code examples 18:50:06 Pl. paste URL 18:50:12 Arnaud: cody, as the editor for the BP&G document, can you please give us an update 18:50:55 codyburleson: now that the spec has changed, the document needs to be updated to reflect the changes (e.g. container type) 18:51:04 ... at least two things from today also need to be added 18:51:33 https://dvcs.w3.org/hg/ldpwg/raw-file/default/ldp-bp/ldp-bp.html 18:51:34 ... I could update the document to catch up with the spec in the next couple of days, but I think the document also needs a team review 18:51:46 Arnaud: I'd rather ask people to review the spec when you think you're done 18:52:06 ... reviewing the document after every change is not efficient 18:52:13 ... do you need people to review it *now*? 18:52:19 ... is there an immediate benefit? 18:52:28 codyburleson: not really, I need to add today's items 18:52:48 ... after this meeting, I could use a few days to update the spec and present it for review 18:53:20 ... I don't know if I have the right words for the changes right now, so I might need to talk to people 18:53:47 Arnaud: if you're not sure, you could put some placeholders in the document and then signal when you're done so we can assign 2 people to review it 18:54:06 ... this doc has never been officially published, and we need to get to that stage since this will be a WG note 18:54:17 q 18:54:28 ... we need to refer to it in the main spec, so it needs publishing 18:54:34 q+ 18:54:53 codyburleson: I can notify the team by 28th to review the doc 18:55:13 Arnaud: on the 21st we'll have a formal call, so 28th would be good 18:55:30 ... we can assign two people to look at it then and then hopefully publish it 18:55:49 ack Ashok 18:56:47 sandro; Section 2.3 "Use Relative URIs" obviously needs to be updated with a big EXCEPT ON POST. 18:56:47 Ashok: as we've gone to the spec, we have said that some things need to be clarified and added to the BP&G so I want to be sure they've been caught and they'll be added to the doc 18:56:52 sandro: Section 2.3 "Use Relative URIs" obviously needs to be updated with a big EXCEPT ON POST. 18:57:48 codyburleson: I'll track people down and talk to them if I don't understand what's in the minutes 18:59:57 Arnaud: we've volunteered to do all these deliverables and we need to keep moving, because I feel that we're not really working on these documents 19:00:26 ... once we're done with the LDP spec I'll start hunting you! (fair warning) 19:00:38 ... and haunting too! 19:02:42 http://lists.w3.org/Archives/Public/ietf-http-wg/2013OctDec/0625.html 19:03:02 [[ 19:03:02 The most relevant proposals were: 19:03:02 A. Opportunistic encryption for http:// URIs without server authentication -- a.k.a. "TLS Relaxed" as per draft-nottingham-http2-encryption. 19:03:02 B. Opportunistic encryption for http:// URIs with server authentication -- the same mechanism, but not "relaxed", along with some form of downgrade protection. 19:03:04 ]] 19:03:31 Arnaud: in terms of timing, we need to look at the charter and the expiration date and see when and much of an extension we need to request 19:03:36 sandro: "expires June 1st" 19:06:45 [people discussing the W3C technical aspects of charter extension] 19:07:05 Arnaud has joined #ldp 19:07:37 [break for 10-15 mins] 19:31:09 [resuming meeting] 19:33:35 Topic: paging 19:34:39 nmihindu has joined #ldp 19:35:17 Ashok: we're trying to make the Web R/W 19:35:27 [Ashok presents slides] 19:36:13 ...databases have stuff that we haven't got on the Web, such as locking, transactions, etc. 19:37:07 +??P1 19:37:16 Zakim, ??P1 is me 19:37:16 +nmihindu; got it 19:37:22 Zakim, mute me 19:37:22 nmihindu was already muted, nmihindu 19:37:32 ... you can have data in the databases that has not yet been computed 19:37:53 ... what are we going to do about the http limitations 19:38:42 ... some possible solutions are to have clients page through collections/graph knowing that it may change during this time 19:38:55 ... the client may use ETags to check if the collection has changed 19:39:16 ... client pages through snapshot of collection 19:40:24 ... the feedback we got was about snapshots and the fact that they cost almost nothing 19:40:40 ... the database guys are used to this system 19:41:16 ... the problem with snapshots is that we don't know when the snapshots are created and deleted 19:41:34 ... the solution is to use locking and transactions instead 19:43:04 Arnaud: we have no guarantee that as you walk the pages, you have seen all the resources in their current state 19:43:22 ... with http there is no guarantee that a change has not been produced during this time 19:43:42 ... Sandro requires guarantees that resources have not been missed 19:44:06 ... it is a reasonable argument, but a difficult one to address 19:44:49 Ashok: what happened to Sandro's variable page size proposal? 19:45:40 http://lists.w3.org/Archives/Public/public-ldp-wg/2014Mar/0063.html 19:45:44 Arnaud: that proposal is guaranteeing that you're not going to miss triples, even through there might be new tripes, but between the time you started and the time you have finished the traversal, you know you won't miss triples from that range 19:46:02 ... I still this this proposal is on the table 19:46:13 ... we got pushed back from Ted 19:46:49 ... the question is: can we find something that is better than what we have now in the spec, which addresses Sandro's proposal 19:49:33 [debate over snapshots are expensive or not] 19:49:41 also cost is not only in size, it's also computing power 19:49:59 [Ashok is defending his take that they are not expensive] 19:52:34 scribenick: betehess 19:52:51 Arnaud: if there was a snapshot feature, of course that'd solve the problem 19:53:01 ... not sure we want to do that 19:53:35 ... there could be an LDP Snapshot spec 19:53:48 sandro: do we want paging to depend on snapshot? 19:54:04 Arnaud: or we can have paging like it is today, with its flaws 19:54:17 TallTed: it's a best effort 19:54:52 ... when we start having snapshot, just advertise it 19:55:25 Arnaud: at WWW last weeek, somebody presented how to do transactions with 2 phase commit, in a restful way 19:55:30 ... including timeouts 19:55:35 ... clients can cancel 19:55:42 ... so there are ways to do it 19:56:06 ... totally doable 19:57:30 TallTed: we need to study the database history 19:57:34 ... to learn from it 19:57:45 scribenick: deiu 19:57:52 We identified at least 8 different transaction models proposed for REST including TCC which Arnaud mentioned http://ws-rest.org/2014/sites/default/files/wsrest2014_submission_4.pdf 19:58:03 Arnaud: isn't option 2 what we have already 19:58:26 sandro: not really, we need another header 19:59:06 Arnaud: the same comments from 2 also apply to 1 20:00:13 sandro: snapshot is a way to implement lossless paging 20:01:34 TallTed: all are viable options with different costs and tradeoffs 20:01:46 ... we should not force clients to choose one over another 20:01:56 ... the negotiation is really important 20:02:15 +1 TallTed, it is important if the client can negotiate that based on its needs 20:02:43 Arnaud: I think we should do option 2, to give the client a fair warning 20:03:33 sandro: we just need another header (similar to ETag) but for the main resource that we apply paging to 20:03:37 q+ 20:04:21 ack betehess 20:04:52 betehess: what about caching? if you add new headers that are not supported by proxies? 20:05:09 sandro: it shouldn't be a problem if we expose that header in the Vary header 20:06:03 OPTION 1: Undetectable Lossy 20:06:03 OPTION 2: Detectable Lossy 20:06:03 OPTION 3: Lossless Paging (Sandro's) 20:06:03 OPTION 4: Use Snapshots 20:06:23 OPTION 5: Transactions 20:06:45 http://ws-rest.org/2014/sites/default/files/wsrest2014_submission_7.pdf 20:06:47 ? 20:06:54 The presentation that Arnaud mentioned TCC - http://ws-rest.org/2014/sites/default/files/wsrest2014_submission_7.pdf 20:08:26 thanks, nmihindu! 20:09:25 sandro: my sense is that 2&3 are the only practical options 20:09:51 ... people should be able to do paging without snapshots 20:10:59 sandro: I want snapshots, but I want paging even on servers that don't support snapshots. So -1 on 4. 20:11:06 TallTed: we need to use common terminology instead of snapshots, so we do not alienate people 20:11:46 sandro: you actually want the state of the resource (of the members) not of the container 20:12:35 TallTed: the best thing to do now is to document what we have 20:13:38 ... option 2 is fine with me 20:13:56 Arnaud: I would like to raise the bar and say that we should agree to do option 2 20:14:12 ... and also to agree to eliminate option 1 20:14:36 PROPOSED: At a minimum, on paging, we'll provide a way for clients to detect that a triple fell through the cracks during paging. 20:14:49 (ie OPTION 2 as a minumum) 20:15:04 +1 20:15:05 +1 20:15:13 +1 20:15:18 +1 20:15:19 +1 20:15:20 +1 20:15:42 +1 20:15:49 +1 20:17:02 +q 20:17:17 RESOLVED: At a minimum, on paging, we'll provide a way for clients to detect that a triple fell through the cracks during paging. 20:19:25 PROPOSED: Any server claiming paging support must provide a way for clients to know that the resource/collection/whatever being paged has changed during the paging. 20:19:38 ack roger 20:20:16 TallTed, that's the right spirit, but.... 20:20:42 roger: if the ETag header is not there, then the client falls back to option 1 20:21:13 ... it's the same as how ETags are used now, clients use it if it's there 20:23:58 Arnaud: we're starting to converge, so let's see if we can eliminate the transactions 20:24:23 we would like to have transaction but we have happy to do it outside the LDP spec 20:24:40 s/we have happy/we are happy/ 20:24:50 Arnaud: the LDP does not _require_ you to do transactions for paging 20:24:58 PROPOSED: We're not going to require use of transactions in order to have paging 20:25:06 +1 20:25:07 +1 20:25:08 +1 20:25:08 +1 20:25:19 +1 20:25:24 +1 20:26:16 +0 20:26:41 1 20:26:46 RESOLVED: We're not going to require use of transactions in order to have paging 20:28:44 PROPOSED: We're not going to require snapshots in order to have (better-than-undetectably-lossy) paging. 20:29:26 PROPOSED: We're not going to require snapshots in order to have paging. 20:29:30 timbl has joined #ldp 20:29:30 +1 20:29:37 +1 20:29:38 +1 20:29:48 -1 20:29:58 +0.5 20:30:04 +1 20:30:05 +0 20:30:42 sandro: Possible design for snapshots: server can include a Link <> rel=snapshot 20:36:25 Arnaud: TAG doesn't really like the 209 code 20:36:46 ... http2.0 support won't happen soon either 20:42:26 JohnArwe: you can use Link with an Context (Anchor) to say this is a snapshot of the PagedResource 20:42:31 +1 nice! 20:44:53 deiu: Servers should not initiate paging. Sometimes you want the 2G resource and dont know how to do paging. 20:46:28 client Prefer: maxPageSize=20m 20:49:44 PROPOSED: An LDP server claiming paging support MAY offer snapshots for paging, but snapshots are not required for paging compliance. 20:50:57 Arnaud: I wonder if we have to specify the 3 options and define mechanisms for each of them 20:51:56 sandro: we can make it a note 20:52:25 Ashok: you can also point to a set of best practices 20:54:15 TallTed: the availability of having that option (3) is key to having paging support 20:54:49 Arnaud: how does the client figure out which options are available? 20:55:23 ... I'm trying to understand how simple/complicated things will be 20:55:44 sandro: option 2 can be done with an extra header; the client doesn't need to request anything 20:56:33 ... Link rels can be used for 3 and 4 20:57:00 http://mementoweb.org/ 20:57:06 http://www.rfc-editor.org/info/rfc7089 21:06:13 just noticed possibly useful... -- http://tools.ietf.org/html/rfc6585 -- "428 Precondition Required" 21:11:56 Arnaud: we should call it a day 21:15:18 complete current HTTP status code list - http://www.iana.org/assignments/http-status-codes/http-status-codes.xhtml 21:18:11 meeting adjourned 21:18:17 Thanks! 21:18:32 G'night. 21:18:47 bye 21:19:48 -codyburleson 21:21:30 trackbot, end meeting 21:21:30 Zakim, list attendees 21:21:30 As of this point the attendees have been +1.617.715.aaaa, nmihindu, codyburleson, MiguelAraCo, ericP 21:21:38 RRSAgent, please draft minutes 21:21:38 I have made the request to generate http://www.w3.org/2014/04/15-ldp-minutes.html trackbot 21:21:39 RRSAgent, bye 21:21:39 I see 1 open action item saved in http://www.w3.org/2014/04/15-ldp-actions.rdf : 21:21:39 ACTION: sandro follow up on resolution about moving rel=describedby text [1] 21:21:39 recorded in http://www.w3.org/2014/04/15-ldp-irc#T18-00-54