[Date Prev][Date Next]
[Chronological]
[Thread]
[Top]
Re: LMDB b-tree question
- To: Kristoffer Sjögren <stoffe@gmail.com>, openldap-technical@openldap.org
- Subject: Re: LMDB b-tree question
- From: Howard Chu <hyc@symas.com>
- Date: Wed, 11 Feb 2015 17:38:47 +0000
- In-reply-to: <CADSBNAgHJPUwDzUaPoviWb=jST98hiVfMmaW4cgymnJZnrnx5A@mail.gmail.com>
- References: <CADSBNAgHJPUwDzUaPoviWb=jST98hiVfMmaW4cgymnJZnrnx5A@mail.gmail.com>
- User-agent: Mozilla/5.0 (X11; Linux x86_64; rv:37.0) Gecko/20100101 Firefox/37.0 SeaMonkey/2.34a1
Kristoffer Sjögren wrote:
Hi
Does every database consist of a separate b-tree or is "database" just a
name spacing convince? I.e. are reads faster for many smaller databases
rather than one large database?
As the documentation says, named databases are separate b-trees. Reads
may be slightly faster, sure, but not by much. You need to have enough
separate DBs to reduce the overall tree height of the equivalent
combined tree to see a measurable difference.
--
-- Howard Chu
CTO, Symas Corp. http://www.symas.com
Director, Highland Sun http://highlandsun.com/hyc/
Chief Architect, OpenLDAP http://www.openldap.org/project/