W3C home > Mailing lists > Public > www-rdf-interest@w3.org > January 2001

Re: Semantic Web Hackings

From: Graham Klyne <GK@Dial.pipex.com>
Date: Mon, 01 Jan 2001 18:16:46 +0000
Message-Id: <>
To: Dan Brickley <danbri@w3.org>
Cc: Martin Bryan <mtbryan@sgml.u-net.com>, <xml-dev@lists.xml.org>, <www-rdf-interest@w3.org>
At 07:42 AM 12/29/00 -0500, Dan Brickley wrote:
>We claim RDF is good at merging data from multiple sources; in my
>experience this is true. The current discussion suggests a crude taxonomy
>of RDF data aggregation mechanisms:
>(1) out-out-of-the-box aggregation ("naive graph merge")
>     All RDF systems do this, by virtue of using URIs for identifiers
>     to merge data from multiple sources.
>(2) 2nd pass node convergence ("data smushing")
>     As discussed above, strategies that merge together RDF from multiple
>     sources in such a way as to figure out (in some cases) where
>     anonymously-mentioned resources are descriptions of the same thing.

This is very reminiscent of the points that Pat Hayes Raised on the RDF 
logic list...  and places they might lead:

Original comments at:
Some later clarification:
Some of my thoughts:

>(3) Fancy Semantic Web inference stuff ("don't hold your breath...")
>     As above but drawing additional conclusions based on complex rules
>     and re-application of (2).
> From where I'm standing, (1) seems really handy, (2) is critical to
>deploying this stuff in the grubby real world where things don't have
>URIs, and (3) is, er, something to keep an eye on.
>My working hypothesis (FOAF etc., more on which another time) is that (2),
>ie. basic techniques for folding RDF data together even when URIs are
>scarse, is enough to build something pretty cool.  Sure we have to make
>some simplifying assumptions, but then that's what the Web's all about...


Graham Klyne
Received on Monday, 1 January 2001 14:01:51 UTC

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