What am I doing with SQL, you ask?

Right now looking at queries that maintain three counter on the same G graph.  U us one counter to get the start rowid of a nested block, the other to get the stop rowid, and the third to get the stuff in between.  We make this iterator concept stanrd for searching fixed from graphs, like dictionary lists.  Rank/file indexing make this a snap.

The sql query scans thousands of records, but still obey simple SET/DESCENT grammar.  The concept here is that the SQL operator on the list elements understands the fixed structure of the list. As the list executes, it can use optimized skimming with out disrupting the state of G.  Start and stpp iterators, with the compound statement make it simpel to add terminators to lists.  Even non triple lists, proprietary sql data can be handled, as long as the query procedure understands enough G grammar to  produce data in nested G triples.

This will work, this will make the SQL industry boom.