do you mean, that one can write a lookup function having a constant execution time, regardless of a symbol table size? Could you give me a pointer?
"Constant time" may not be true, but possibly there are better storages (although they may not be that lightweight). Have a look at: http://www.sourcejudy.com (the "Judy scalable hashing" configuration should be especially interesting).
greetings, Thomas