Julian Kippels:
> > You are doing N/2 table lookups to find the table that contains the
> > data. That is, you're doing linear search on top of hashing.
> >
> @Wietse: N/2 is a little pessimistic, but thats only because I know the
> makeup of my mailboxes? 90% of it is in one virtual domain and that
The point is that you're slower than one table, whether it's N/2
or N/somethingelse.
> Anyway, I am going for a single big file now. I assume its not a problem
> that this map is 40MB big?
With a competent key-value store implementation, reading from a
40MB table should be no problem.
Wietse
