On Apr 27, 2008, at 1:11 PM, Karl Ebener wrote: > AFAIK some DHTs use order preserving hash functions,
I'm wondering what an order preserving hash function is. Any reasonable definition that I can guess it means seems to imply that only the identity function on high order bits of sort key would work - this would be a sort of lame hash unction - so I'm at a bit of a loss to figure out what this is. Sounds interesting thought - curios to learn more. _______________________________________________ p2p-hackers mailing list [email protected] http://lists.zooko.com/mailman/listinfo/p2p-hackers
