[Date Prev][Date Next] [Chronological] [Thread] [Top]

Re: subtree vs. onelevel performance?

To: Hallvard B Furuseth <h.b.furuseth@usit.uio.no>
Subject: Re: subtree vs. onelevel performance?
From: Howard Chu <hyc@symas.com>
Date: Thu, 20 Jan 2005 11:06:34 -0800
Cc: openldap-software@OpenLDAP.org
In-reply-to: <hbf.20050120vtgy@bombur.uio.no>
References: <hbf.20050120vtgy@bombur.uio.no>
User-agent: Mozilla/5.0 (Windows; U; Windows NT 5.1; en-US; rv:1.8a5) Gecko/20041101

Hallvard B Furuseth wrote:

Does one of Subtree or Onelevel search have any performance benefit
over the other, when searching an entry with no grandchildren?
No aliases or referrals are involved.

Not likely. Not in back-bdb or back-ldbm at least. Possibly in back-hdb, depending on cache state; once the cache is fully seeded then there should be no difference.

--
 -- Howard Chu
 Chief Architect, Symas Corp.       Director, Highland Sun
 http://www.symas.com               http://highlandsun.com/hyc
 Symas: Premier OpenSource Development and Support

References:
- subtree vs. onelevel performance?
  - From: Hallvard B Furuseth <h.b.furuseth@usit.uio.no>

Prev by Date: syncrepl problem
Next by Date: Re: OL and large databases
Index(es):
- Chronological
- Thread