Monday, November 21, 2011

How do G and SQL crawl the stack?

We have a nest graph in tripple store, and want to follw a set of links back to the top, maybe adjusting a variable.  How do we do that?  With the gfun it is not a problem:
select AdjustPointer() where PrecedingNode() == rowid;

Its a snap. SQL maintains the triple store, the two coordinate in rapid forward and backward link skipping. Very high speed SPARQL queries, creating long, structured list, marked with relavent operators, all in triple format.

No comments: