00:14:12 scor has quit (Quit: scor) 00:29:27 bblfish has quit (Read error: Connection reset by peer) 00:30:02 bblfish (~bblfish@AAubervilliers-651-1-127-44.w86-198.abo.wanadoo.fr) has joined #dig 01:29:18 presbrey has quit (Quit: Terminated with extreme prejudice - dircproxy 1.2.0) 01:32:30 scor (~scor@c-98-216-97-72.hsd1.ma.comcast.net) has joined #dig 01:32:30 scor has quit (Changing host) 01:32:30 scor (~scor@drupal.org/user/52142/view) has joined #dig 02:22:13 presbrey (~presbrey@2001:4830:2446:b5:aede:48ff:fe00:6001) has joined #dig 02:44:19 bblfish has quit (Read error: Connection reset by peer) 02:44:55 bblfish (~bblfish@AAubervilliers-651-1-127-44.w86-198.abo.wanadoo.fr) has joined #dig 03:40:05 scor has quit (Quit: scor) 05:03:03 Pipian (~pipian@static-mum-59.181.115.17.mtnl.net.in) has joined #dig 07:12:33 Pipian_ (~pipian@static-mum-59.181.115.17.mtnl.net.in) has joined #dig 07:12:33 Pipian has quit (Read error: Connection reset by peer) 07:12:34 Pipian_ is now known as Pipian 07:15:01 melvster (~melvin@p5797F363.dip.t-dialin.net) has joined #dig 07:32:43 rszeno (~rszeno@79.114.102.131) has joined #dig 07:37:19 melvster has quit (Remote host closed the connection) 07:37:48 melvster (~melvin@p5797F363.dip.t-dialin.net) has joined #dig 07:58:12 deiu (~andrei@unaffiliated/deiu) has joined #dig 09:10:45 presbrey has quit (Ping timeout: 240 seconds) 09:10:52 betehess has quit (Ping timeout: 245 seconds) 09:11:17 betehess (~betehess@2001:470:8b2d:804:1d4e:3963:99ee:e9d3) has joined #dig 09:12:29 presbrey (~presbrey@2001:4830:2446:b5:aede:48ff:fe00:6001) has joined #dig 10:14:49 cheater__ has quit (Ping timeout: 246 seconds) 10:28:16 cheater__ (~cheater@g230227254.adsl.alicedsl.de) has joined #dig 10:32:52 Pipian has quit (Ping timeout: 248 seconds) 10:48:00 Pipian (~pipian@static-mum-59.181.115.17.mtnl.net.in) has joined #dig 10:48:00 Pipian has quit (Client Quit) 11:19:41 trueg (~trueg@dslb-094-217-041-120.pools.arcor-ip.net) has joined #dig 11:22:14 RalphS (Ralph@w3cdhcp61.w3.org) has joined #dig 11:46:43 melvster1 (~melvin@p4FF96E37.dip.t-dialin.net) has joined #dig 11:48:06 melvster has quit (Ping timeout: 264 seconds) 12:53:47 t4nk286 (a103012a@gateway/web/freenode/ip.161.3.1.42) has joined #dig 12:55:08 hi 12:56:38 hi, i have a question about rdflib.js. 12:56:48 t4nk286 has quit (Client Quit) 12:57:11 rblin (a103012a@gateway/web/freenode/ip.161.3.1.42) has joined #dig 12:57:28 is it possible in rdflib to fetch remote graphs in parallel? 12:57:37 what method do I call? 13:00:11 rblin, I think presbrey or melvster1 are those who know most about this lib. Perhaps it is also worth asking that question on github as a bug report 13:00:43 with explanation of where you are seeing the problem 13:00:52 RalphS has quit (Ping timeout: 265 seconds) 13:01:26 RalphS (Ralph@30-7-118.wireless.csail.mit.edu) has joined #dig 13:04:13 I try to make a loop on all foaf knows of one foaf profile but when i want to check if all foaf:knows are loading i have only the last foaf knows loaded. 13:05:42 what method are you calling? 13:07:59 fetch.nowOrWhenFetched() 13:09:23 did you check with Wireshark if the connections were being made? 13:10:00 I am not sure if rdflib can do fetches in parallel, or more than one at a time, or if one needs to create different fetch objects.... 13:11:51 yes I check it with wireshark and when i want to load 5 foaf at the same time i have 5 HTTP GET in my wireshark console 13:12:18 those GETs are going on in parallel? 13:13:55 GETs are launch successivly in a loop. 13:15:05 so you do something like for (url <- friends) { fetch.nowOrWhenFetched( function() { do something with result } ) } 13:15:07 ? 13:15:35 (can't remember the exact method calls) 13:15:57 perhaps fetch(url).nowOrWhenFetched(...) 13:17:00 yes 13:18:24 and you see wireshark downloading these in parallel? 13:20:00 yes :) 13:22:35 ok, so I think then it's your client code that is overwriting the graphs perhaps, or that is now able to use the information 13:22:51 I would create a hashmap URL=>Graph for each downloaded graph 13:41:46 there are a lot of good examples at https://github.com/linkeddata/rdflib.js/blob/master/test/ 13:42:09 but it is true that some good documentation would be helpful, to know what methods are available on a graph 13:42:12 graph.size? 13:43:03 no 13:48:00 scor (~scor@w0107748.mgh.harvard.edu) has joined #dig 13:48:00 scor has quit (Changing host) 13:48:00 scor (~scor@drupal.org/user/52142/view) has joined #dig 13:48:30 amy (~amy@30-6-207.wireless.csail.mit.edu) has joined #dig 13:51:10 there must be a way to iterate through the graph in the mean time, so you can find out its size.... perhaps graph.length 14:25:51 bblfish_ (~bblfish@ALagny-551-1-140-22.w92-141.abo.wanadoo.fr) has joined #dig 14:27:24 bblfish has quit (Ping timeout: 250 seconds) 14:58:28 bblfish_, are you going to start the teleconf yourself? 14:59:31 bblfish (~bblfish@AAubervilliers-651-1-127-44.w86-198.abo.wanadoo.fr) has joined #dig 15:02:11 bblfish_ has quit (Ping timeout: 246 seconds) 15:29:35 rblin has quit (Ping timeout: 245 seconds) 16:20:27 danbri has quit (Remote host closed the connection) 16:25:16 danbri (~danbri@cable-146-255-148-108.dynamic.telemach.ba) has joined #dig 16:34:52 danbri_ (~danbri@cable-146-255-150-74.dynamic.telemach.ba) has joined #dig 16:35:35 danbri__ (~danbri@cable-146-255-148-108.dynamic.telemach.ba) has joined #dig 16:38:39 danbri has quit (Ping timeout: 244 seconds) 16:39:41 danbri_ has quit (Ping timeout: 244 seconds) 16:45:04 trueg is now known as trueg_away 16:48:30 trueg_away is now known as trueg 17:12:14 deiu has quit (Ping timeout: 244 seconds) 17:21:51 trueg is now known as trueg_away 18:31:54 betehess_ (~betehess@31-35-216.wireless.csail.mit.edu) has joined #dig 18:32:41 betehess_ has quit (Client Quit) 18:38:00 timbl (~timbl@93-62-235-11.ip24.fastwebnet.it) has joined #dig 19:22:23 timbl has quit (Quit: timbl) 19:28:28 melvster (~melvin@p4FF96242.dip.t-dialin.net) has joined #dig 19:29:57 melvster1 has quit (Ping timeout: 265 seconds) 19:50:13 manu1 has quit (Ping timeout: 246 seconds) 20:01:07 bertails, hi! 20:01:58 from time to time we should sync up so we know where we are going :-) betehess 20:04:56 manu1 (~chatzilla@pool-96-240-166-105.ronkva.east.verizon.net) has joined #dig 20:07:51 danbri (~danbri@cable-146-255-150-74.dynamic.telemach.ba) has joined #dig 20:09:49 danbri__ has quit (Ping timeout: 246 seconds) 20:19:55 RalphS has quit () 20:32:14 kennyluck has quit (Ping timeout: 246 seconds) 20:41:09 kennyluck (~kennyluck@114-43-117-27.dynamic.hinet.net) has joined #dig 20:47:11 trueg_away is now known as trueg 20:48:42 trueg has quit () 20:55:44 danbri has quit (Remote host closed the connection) 21:06:43 $35000 WebID challenge http://www.healthdata.gov/blog/platform-challenge-1-simplified-sign 21:09:00 bblfish: there is no need for a default graph 21:09:58 where do you put the information that links a graph to its metadata? 21:10:06 wherever you want 21:10:15 well why not call that the default graph 21:10:25 because it does not make sense 21:10:30 for example 21:10:49 I see where you're going, so let me explain that 21:11:38 case 1: everything is on the file system. every graph is in its own file on the disk, let's say base-dir/foo/bar/baz.ttl 21:12:10 the server can follow this convention: the metadata is available at base-dir/foo/bar/baz.meta.ttl 21:12:13 done 21:12:18 now case 2 21:12:32 everything is in an rdf store 21:12:54 solution 1: you do the same as in case one, but with the rdf store 21:13:25 solution 2: you use one mega graph to hold all the metadata, and you call it something like "ldp:my-default-graph" 21:13:36 which is not meant to be exposed by the LDP server 21:13:48 again, it's an implementation detail 21:14:48 the client only knows that if it wants to "know more" about the graph that it is GETting, it just needs to follow the Link header 21:15:02 how do you get the list of all graphs in teh store currently? 21:15:17 I think that's part of the AP'I I suppose 21:15:21 why do you need it? 21:15:46 Well maintenance of graphs, know how much memory I am using, things like that 21:16:23 so you want to centralize the data somewhere 21:16:37 think about that: does Apache needs to know that? 21:16:47 still, it can serve files 21:16:51 that's the same 21:17:03 who is using the graphstore api? 21:17:35 that agent would want to know these things... 21:18:01 I just think there is an interpretation of default graphs where it makes sense 21:18:09 ok, let me comment there 21:18:26 ( the union of all graphs certainly is stupid ) 21:18:45 first of all, do you agree that you could choose whatever graph to hold this kind of information? 21:18:57 instead of the default one? 21:19:34 then, what you want is a way to answer questions like: how many graph do I have 21:19:38 the problem with any graph, is that then you have a problem finding out which one it is 21:19:46 you are asking the store to know its name 21:20:03 sesame and jena offers that in their api, so you should not have to maintain it yourself 21:20:07 it's like I should be albe to talk to you even when you don't remember your name :-) 21:20:17 also, think about a purely file-based implementation, like Apache 21:20:32 apache has metadata too: it's the file system 21:20:35 having centralized data for that would make it more difficult to scale on different server 21:20:43 and apache has config files 21:20:58 I don't see why you call it centralised 21:21:08 guess what, when you access the file system, you iterate over all the files to get the information. there is a cost 21:21:13 that's explicit 21:21:22 there is no centralized index 21:21:30 which is very important 21:21:48 but the data store itself knows a lot about its contents, no? 21:21:59 not necesseraly 21:22:10 well it should know what contents it has 21:22:12 only if you add this constraint in the api 21:22:19 depends 21:22:44 making that mandatory in the main interface would be a huge mistake 21:22:57 you could impose another typeclass for it 21:23:10 but even that, I'm not sure that you really need it 21:23:27 at least, don't impose yourself to have to maintain this kind of metadata 21:23:30 you can always create a named graph as you say to put that info 21:23:41 but you'll have to maintain it 21:23:47 in a very centralized way 21:24:00 but I think on startup an amin needs to be able to ask queries even when the admin does not know what graph is the name of the default graph 21:24:03 or, you may want to get something that iterates over the existing graphs 21:24:27 the way you are doing things you are going to make the admin's job debend on knweldge of an external resource. You can't bootstrap the thing 21:24:29 don't understand your last comment 21:24:38 of course you can 21:24:51 you tell the admin to "RTFM" 21:25:09 but each implemetnation is going to place the default graph elsewhere 21:25:23 it's like . 21:25:26 in the file system 21:25:31 so what? you don't expose this information anyway 21:25:39 it's server specific 21:25:51 yes, the server admin also needs to get going 21:25:52 Apache does not tell you on what filesystem it's running 21:26:06 sure, but that's implementation specific 21:26:08 but you know which file you start off looking for config info 21:26:22 default graph is just an indexical 21:26:28 config is something totally different from the current discussion 21:26:38 it says give me the metadat store of the store 21:26:47 even if I don't know what it is named 21:26:48 that's *your* interpretation 21:26:50 your convention 21:27:00 yes, what is wrong with it? 21:27:05 people may have other plans for their default graph 21:27:14 because you don't have to impose it 21:27:21 that's just wrong and useless in this case 21:27:36 it will never be exposed by LDP 21:28:21 if you want to write a server that provides to the sysadmin this kind of information, why not, but you need to be aware of the implications 21:28:43 well I think we'll probably find out by using it 21:28:51 IMO, making that efficient though metadata that you would maintain is just plainly wrong 21:29:40 try to think how you would do that 1. without centralized index 2. with a pure filesystem-based implementation 21:30:20 yes, ... I'll see how it works in practice. But I have a feeling that you may need the index. But I can't tell for sure. 21:30:27 and tell the sysadmin to do "man du", like with apache 21:30:29 As I say even in the file system you have the . notation 21:31:01 if there is an index, we won't scale, and we'll actually make the administration more complicated 21:31:15 think about why Apache is so loved by sysadmins... 21:31:59 I don't understand re: in the file system you have the . notation 21:32:32 well I am thinking of the default graph as an indexical for the metadata 21:32:58 so everytime someone is accessing the store, you need to block on the default graph to update it????? 21:32:59 Also the other thing I am looking at is how this compares to N3 which has a main graph that cotnains graphs 21:33:18 ah ok 21:33:25 that's what you mean 21:33:36 that's just a consequence 21:34:00 and I know that you don't like the word "block" 21:34:01 :-) 21:34:10 well we have a lot of blocking things in there 21:34:17 we should really rewrite all of it 21:34:23 like what? 21:34:34 is sesame and jena not blocking? 21:34:44 the parsers are blocking mostly 21:34:47 in the current naive implementation, maybe, but not in the future 21:34:53 :-) 21:35:04 the interface is fine re: store 21:35:08 ok. Still do you think that 21:35:23 null.instanceOf[URI] is really a good idea? 21:35:26 no 21:35:41 if we *have to*, it would be store.getDefaultGraph() 21:35:45 ah ok 21:35:48 but as we won't do it, don't worry 21:36:09 well Pat Hayes presentation is quite interesting btw 21:36:15 I know 21:36:26 anyway... I am writing a CORS proxy right now 21:36:33 but that's not that relevant until Pat changes everything in RDF and SPARQL 21:36:56 was my checking ok? 21:37:03 checking? 21:37:08 check-in 21:37:13 the last one? 21:37:17 I hope so :-) 21:37:36 ah ok, so you have had no problems yet 21:37:44 I've been working on a RecordBinder 21:37:47 not ready yet 21:37:55 the Sesame issue is odd because I added some simple tests and those work 21:37:56 I've not synchronized yet 21:38:14 what was the library you metnioned for doiong closing of sockets? 21:39:16 last week, when you looked at Sesame 21:39:19 hrmmm 21:39:28 scala-arm I believe 21:39:40 from Josh Suerueth 21:39:54 ah found the notes 21:40:16 yes http://jsuereth.com/scala-arm/usage.html 21:40:35 I think un-jon was thinking or asking about transactions 21:40:56 thinking abut implementing transactions with his monadic contexts 21:41:37 why not 21:41:47 I'm waiting for a demonstration of the value 21:42:07 also, if we support only one context, this would be useless 21:42:08 ok. Good, if monadic contexts help transactions then that seems like it would add value 21:42:22 maybe 21:42:33 all to be seen 21:42:58 I find it more useful to start with real world problems and then to move to change stuff 21:42:58 monads would make explicit the fact that we only need the sequence 21:43:37 I was thinking in discussion with un-jon that perhaps 21:43:44 the graph object should be 21:43:46 mutable 21:43:56 or rather there should be mutable and immutable 21:44:02 like in scala collections 21:44:19 that would be ok 21:44:20 ( just an idea ). The reason being that sesaem and jena are mutable 21:44:24 yes 21:44:34 that would be fine 21:44:38 of course a good implemetnation would use non-mutable data structures 21:44:44 ah ok good :-) 21:44:45 yes 21:44:57 well, as long as you don't mess with the types, it's fine 21:45:27 also, make sure that you make defensive copies when going from mutable to immutable 21:45:39 For the moment I don't need it. But I can see that one could. It would be nice to have real immutable graphs that don't do a whole copy (ie are efficeint) 21:45:41 same the other way actually... 21:45:53 well, we need it with Diesel 21:46:08 diesel is O(n**2) because of that 21:46:13 ah ok. 21:46:28 as it uses graph union 21:46:30 +1 then for that 21:46:54 Ok. run out of ideas I think 21:46:55 well, it works for now, so let's wait until we have real performance issue 21:47:19 yes I should present myself on the Linked Data Platform working group soon 21:47:23 "n" is never big with Diesel 21:47:39 can you join it through the Apache Foundation? 21:47:46 I am already in 21:47:48 k 21:47:53 just have not had time to say hello 21:48:06 WG means I'll have to do some work 21:48:46 should have CORS working soon, and the RWW should be going too. 21:49:22 well thanks for the feedback :-) 21:50:09 DIGlogger: pointer? 21:50:09 See http://dig.csail.mit.edu/irc/dig/2012-07-03#T21-50-09 21:50:53 sure 21:50:54 we need to get this working for Lyon in October 21:50:58 yes 21:51:02 :-) 21:51:03 I should be there btw 21:51:31 oh and for Chaos Communication Congress in december, with Tor 21:51:49 hrmmm, now I need to do a foldLeft on a HList #shapeless 21:52:07 un-jon showed how one could do webid over Tor competitor i2p 21:52:17 wow, nice 21:52:17 well linked data over i2p 21:52:27 that is nice 21:52:37 can't wait to see 21:52:40 one could have linked data over i2p and tor and normal web. That would be really cool :-) 21:53:14 does he have some writings about that already? 21:53:47 he just got i2p working on his computer published a foaf file in the .i2p url 21:54:21 you have things like 21:54:38 http://sdfsdfsdfsdf.onion/betehess/foaf.n3 21:54:55 or http://ssdfsdfsdfs.i2p/bblfish/foaf.rdf 21:55:14 as the webid? 21:55:16 sdss... are cryptokeys that identify the machine in a distributed has table 21:55:20 yes 21:55:22 oh 21:55:24 I see 21:55:31 well with #me at the end or soemthing 21:55:47 so you can do linked data over those 21:55:52 but this is not considered as anonymous, isn't it? 21:55:53 then you can do tls auth over them too 21:56:20 well if you wanted to be clever you'd of course not put such an obvious url 21:56:35 you could even have one-time webid 21:56:40 not /bethess/foaf.n3 but perhaps /btls/#me 21:56:59 k 21:57:01 the important thing about these networks is that people don't know where your machine is 21:57:16 so they don't know where you are 21:57:37 and you could just show people who don't know you a public key 21:57:45 and to your friends have a link to a full profile 21:58:04 plus you don't need TLS server auth 21:58:16 because the server is dientified cryptographically 21:58:18 that sounds wonderful 21:58:37 yes, just need to try it out to see hwo it works out :-) 22:03:25 scor has quit (Quit: scor) 22:30:05 danbri (~danbri@cable-146-255-148-108.dynamic.telemach.ba) has joined #dig 22:33:40 danbri has quit (Remote host closed the connection) 22:53:20 melvster has quit (Ping timeout: 252 seconds) 23:09:49 bblfish has quit (Read error: Connection reset by peer) 23:10:25 bblfish (~bblfish@AAubervilliers-651-1-127-44.w86-198.abo.wanadoo.fr) has joined #dig 23:20:49 amy has left #dig