How your web bot steps along the web

I think the marketing term should be Qbots, made of Qsons, walking the graph.

The concept here is that your bot wants to take a step up the web graph, and that consumes web resources. the Web graph wants a match, it needs at the minimum a key word match between its gateway node and your search graph head. The model here is that your gets gets permission to step up the web, taking its itself along, naturally.

This concept of stepping, your bot stepping a cursor through itself, and another bot stepping a cursor along itself. Each cursor will step if the match conditions are correct. This is the generalized join, and with wild cards of certain sorts at either graph, outer lefts and right can be constructed.

In the engine, this is a very fast process, ultimately done in compiled sqlite3 code, which is designed to step along graphs. Keywords zoom though key word tables. But it can be slow at gateways, as slow as getting your encryption key processed.

The engine right now is very good at stepping along one graph at a time, as if the other graph was always stationary, a wild card that self steps in place and reports yes. Filling a table is three step process.

machine_new_operator(table,append);
while(more){
machine_append(triple);
triple++;
}

I have a switch, it will move Qson bundles anywhere, under windows or unix. Qbots can hop around.