- From: Kingsley Idehen <kidehen@openlinksw.com>
- Date: Tue, 17 Mar 2009 17:10:17 -0400
- To: marko@lanl.gov
- CC: public-lod@w3.org
Marko A. Rodriguez wrote: > Hello, > > >> One source of the raw data would be: http://lod.openlinksw.com . >> Once we have a voID graph you should be able to use that to perform real >> graph analysis across the LOD cloud :-) >> > > I just looked into voID -- an RDF graph that describes the linking of RDF > graphs is very helpful. Question: is there an instance of a voID graph for > the LOD cloud as it is right now? > It is coming, ETA: this week. > With respect to analyzing the Linked Data cloud at the triple-level: I'm > more than happy to work on something of that size, but multi-relational > graph analysis is a little more complex (and computationally expensive) > than single-relational graph analysis (see [1] and [2]). Moreover, given > the billion+ triple scale, we are talking some major clock cycles. > VoiD contains the stats, about the huge corpus. Yes, that in of itself is quite large, but nothing like working through the raw data. > Moreover, and to exacerbate the problem, pull-based HTTP is not the best > mechanism for walking a graph. Again (as I've said in other work), LOD > following the WWW paradigm will be limited in the sophistication of the > type of algorithms (graph or otherwise) that can be practically executed > on it. However, beyond an exploratory analysis at the triple-level, if > there was an interesting hypothesis, I would be more than willing to > provide my expertise. Any thoughts in particular? > Easier to comment further when the graph is ready. I prefer show rather than tell :-) Kingsley > [1] http://arxiv.org/abs/0806.2274 > [2] http://arxiv.org/abs/0803.4355 > > Take care, > Marko A. Rodriguez > > http://markorodriguez.com > > -- Regards, Kingsley Idehen Weblog: http://www.openlinksw.com/blog/~kidehen President & CEO OpenLink Software Web: http://www.openlinksw.com
Received on Tuesday, 17 March 2009 21:10:53 UTC