- From: Geoff Chappell <geoff@sover.net>
- Date: Fri, 12 Mar 2004 19:52:08 -0500
- To: "'Adam Souzis'" <adam-l@souzis.com>
- Cc: <www-rdf-interest@w3.org>
> -----Original Message----- > From: www-rdf-interest-request@w3.org [mailto:www-rdf-interest- > request@w3.org] On Behalf Of Adam Souzis > Sent: Friday, March 12, 2004 5:51 PM > To: Jeremy Carroll > Cc: www-rdf-interest@w3.org > Subject: Re: a bnode URI scheme?! > > > Jeremy Carroll wrote: > > > As far as I am aware there is no software available for Jena that > > permits you to automatically trim G to G'. > > does anyone know of any RDF software that does this (remove redundant > nodes, aka find lean sub-graph)? RDF Gateway has a merge method on its datasource object that allows you to merge one set of triples with another, removing redundant triples in the process. For method docs w/example see: http://www.intellidimension.com/pages/rdfgateway/reference/script/dataso urce_merge.rsp It's intended to deal with the problem you describe below, more than it is to reduce a graph to lean form. > A use-case where this is needed is the versioning of rdf models -- as a > model changes over time and a version control system merges the changes > in, bNodes will proliferate (in particular list bNodes created by > parseType="collection" ). I'm actually encountering this issue right now > with Rhizome, my content management system that treats everything as RDF > (rx4rdf.sf.net). > > -- adam Geoff
Received on Friday, 12 March 2004 19:52:17 UTC