A bit about G graphs

G = (a,b.(c,d,(x.y)),e.f.(g,h).k)

A G graph described in Typeface Explosion Laid in nested form:

a ,
b . 
    c  ,
    d ,
        x . y
e , f . 
        g  ,
        h  ,
            k . 

The graph is laid out in nested order, just pick off the indentation marks as rank and line count as file. I did not apply the distributive property on k. (Note: pointer arithmetic is still in design phase).

The G machine provides the gfun call under sqlite3 which can maintain pointers for the output result and perform skips on self and other. So SQL procedures can be written to a common definition of pointer, allowing them the property of skipping over nested subgroups. Gfun provides the NextSet function, skip ahead to the next element in the set, as well as a number pof other skipping about functions and they work on all triple formats in the equation:
result = @(self,other) Gfun will be able to apply the distributive property on k in version 2.0. I that vesion, a NextDependentAnd function will be added to gfun methods.