Re: Circular references in RDF data model

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


Received on Thursday, 5 October 2000 10:12:13 UTC