From: Ralf Hildebrandt (no email)
Date: Tue Jul 02 2002 - 06:49:19 EDT
On Tue, Jul 02, 2002 at 05:14:36AM -0500, Phil Howard wrote:
> | Looking up something in one btree:
> | O(n) = ln(n) (well, sort of)
> |
> | Looking up something in x btrees of size (n/x):
> |
> | O(n) = x*ln(n/x)
> | which is bigger than ln(n)
>
> What is x? I think you are making the same mistake Victor did and are
x << n
(x is the number of maps)
> trying to sequentially search each map separately. Such a search can't
> even work since a map per-domain should have only the user part as the
> key.
All maps are searched. So if you key is in the last map, it has to
search each maps until a match is found.
> Just search ONE map, the one for the appropriate domain. Then we're
Postfix doesn't do that (yet)
-- Ralf Hildebrandt (Im Auftrag des Referat V A) Charite Campus Virchow-Klinikum Tel. +49 (0)30-450 570-155 Referat V A - Kommunikationsnetze - Fax. +49 (0)30-450 570-916 Why you can't find your system administrators: They've gone to find some more coffee. Sysadmin has left the building! -- Matt Haswell - To unsubscribe, send mail to with content (not subject): unsubscribe postfix-users
|
|
|