The entropy encoded hash table is coded by Huffman as iLog(i), where i is the probability of occurance, total i being 1. The look up addresses are ordered in a linear table, shortest addresses first. Hence the total, maximum encoding of client retrievals. And as a bonus, a computation on the address size give your a very close approximation to its location. I think the access time will be linear with the overall useage.
This idea is unpatented, available for free use, perhaps along side peer to peer addressing from Dhash at MIT. I'll get these addressing algorithms, and get the look ups working as nested stores, the bot can traverse it quickly, and grab a goodie.
Some neat things to do in semantic web.
You can have your own police bot, it hangs around a server and guards your indices. Only you or your friends can gain access. Police bot can share secret encryptions, a human holds the master key. But that set up is great for trading, great for very fast look ups, ad hoc indexing. Lot's of opportunities for very private and very public associations. And zippy fast.
This is an order of magnitude more advanced than any of those other kids have. Never once does the grammar inside the machine force a key move, it all exoskeleton. Where's my exo kernel, Cray is drooling.
No comments:
Post a Comment