On Tue, Jul 02, 2002 at 12:49:19PM +0200, Ralf Hildebrandt wrote:

| 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.

That would produce the wrong results.

| > Just search ONE map, the one for the appropriate domain. Then we're
|
| Postfix doesn't do that (yet)

So it might be me who makes it do it.

-- 
-----------------------------------------------------------------
| Phil Howard - KA9WGN |   Dallas   | http://linuxhomepage.com/ |
| phil-nospamipal.net | Texas, USA | http://phil.ipal.org/     |
-----------------------------------------------------------------
-
To unsubscribe, send mail to majordomopostfix.org with content
(not subject): unsubscribe postfix-users

• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]