2 Apr
2012
2 Apr
'12
6:22 p.m.
Arne Goedeke wrote:
have been developing. This one uses a different algorithm than the one we briefly mentioned on the conference. The new one uses a hashtable for page lookup instead of radix trees.
The benchmarks are impressive. However, using a hashtable always pops up the question, what is the worst case for this implementation, and when does it happen?
--
Stephen.
"Sleep: A completely inadequate substitute for caffeine."