W3C home > Mailing lists > Public > public-lod@w3.org > March 2009

Re: Source file of the LOD connectivity patterns

From: Marko A. Rodriguez <marko@lanl.gov>
Date: Tue, 17 Mar 2009 15:00:01 -0600 (MDT)
Message-ID: <60435.>
To: "Kingsley Idehen" <kidehen@openlinksw.com>
Cc: public-lod@w3.org

> 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?

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.
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?

[1] http://arxiv.org/abs/0806.2274
[2] http://arxiv.org/abs/0803.4355

Take care,
Marko A. Rodriguez

Received on Tuesday, 17 March 2009 21:00:42 UTC

This archive was generated by hypermail 2.3.1 : Wednesday, 7 January 2015 15:15:55 UTC