Back to graph stepping

The machine up their at github, it has a memory form of Qson, the closely compact association of key link,pointer, and key value; all together. Very fast stepping through a search graph in memory. The machine knows that, direct the key word match to an sql operator, wiht a search coll back. On call bak, tjust maintin the search pointers for the memory graph. Using insert select case union, the operator could rapidly zoom through the search graph, against a very huge database. You know, designed to zip whole Qson graphs around, so we get hybrid version of the general join. Service providers using encryption gate way nodes to collect pennies for a thousand hops.

But you get a myriad ways of looking, each efficient, each with a market. If clients agreed to 16 byte words limits, the machine could have that immediate key property, and always kick in higher speed search due to shorter guarantees on key length. You local machine could have very complicated info stored in a variety of ways. But knowing you will be limited to 16 byte key words makes all that info available instantly. Vendors of data and vendors for B tree technology will cooperate, making huge stores readily available at the home machine. The engine developers will compete for the best browser B tree, they will come up with amazing stuff, knock our socks off. They just attach their B tree machine to the grammar engine.