Qson separates the fixed length graph vaiables from the variable length key values. Being based on rowid, Qson presents a natural method for high speed indexing along graphs, its makes possible a separate mechanism for rowid mechanisms, so fast, that rewriting a graph is more like shuffling an array, of triplets. I can easily envision a machine that could insert and delete section of whole sub graphs, and leave key value garbage management for later. The optimum Q machine.
We get very high speed stepping by indexing, with a potential variety of ways. Code blocks with intelligent argument matching, actually very competitive parallel processing. They come in nested chunks. In the case of this machine, it can point Sql to any nested chunk in any table and run the rows on two table at a time. For a parallel, that means shared memory is ready to go, the chunks are nested, exchahnge positions at the match points using the complete and closed grammar. gain, parallel locking comes with the forward looking graph pointers and block identifiers.
Qson, fast, intelligent and compatible with any browser that talks Json, which is any browser!
No comments:
Post a Comment