W3C home > Mailing lists > Public > www-rdf-interest@w3.org > October 2000

Re: Circular references in RDF data model

From: Frank V. Castellucci <frankc@colconsulting.com>
Date: Thu, 05 Oct 2000 10:39:19 -0400
Message-ID: <39DC9297.7B6F695D@colconsulting.com>
To: Ross Judson <ross@ManagedObjects.com>
CC: www-rdf-interest@w3.org
Ross Judson wrote:
> As Brian stated, circular references aren't really an issue for
> implementors.  It's definitely an issue for programs that use the
> implementation, though -- walking an RDF graph has to use the same rules for
> walking any type of graph structure (you need good graph walking patterns).
> We use something we call the "Tour Bus" pattern: things that want to walk
> the graph are queued up and sorted by the kind of walk they want to do.
> Every once in a while a "tour bus" leaves the station with a bunch of things
> that want the same walk (but might do different things).  The bus walks the
> "tourists" through the graph, using a "guide" (walk controller).
> RJ

Yes, directed cyclical are as valid as directed acyclical graphs, you
just need to (as a application that is reasoning with the model) be more
careful with the former.

My 0.02

Frank V. Castellucci
OOA/OOD/C++ Standards and Guidelines for Linux
Pythons Pattern Package
Received on Thursday, 5 October 2000 10:36:03 UTC

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