When I speeded up the machine using he sqlite3 Begin and End transaction, I sort of adopted two new canonical machine instructions for marching through the web. MachineLock requests a lock on the local graph processor, MachineUnlock releases it. What I am doing is trying to separate out those instructions that represent operations of marching through the nodes of a graph. The is the model bot logic uses for normal joins in sql, two bots perform a canonical walk upon each other.
But the Begin and End in sqlite3 lets me remove the need for Linux semaphore, it is the semaphore itself. So the encapsulation of all the Linux management is done at the machine layer. For the Bo is it lock the machine, I am taking some steps. And since each Sqlson is treated as an atomic unit subgraph, I lock the machine, let the Sqlson run through, ten unlock. If the Sqlson take a detour to another machine, it rests itself and unlock, the returning bot will quietly awake its parent and continue.
Simple stuff in the sense of bot node by node traversal are a set of rules much simpler than grammar school English. In the semantic machine,the problem boils down to, with two triplets, one fro each table, and the accumulated set of conditions from the parents, what are the choice between one of four outcomes, either of them can descend or hop to the next set element, possibly collecting key words from the other int the process.
No comments:
Post a Comment