Issue 7473 - back-mdb is 50x slower than back-hdb on datasets with numerous subtrees
Summary: back-mdb is 50x slower than back-hdb on datasets with numerous subtrees
Status: VERIFIED FIXED
Alias: None
Product: OpenLDAP
Classification: Unclassified
Component: slapd (show other issues)
Version: unspecified
Hardware: All All
: --- normal
Target Milestone: ---
Assignee: OpenLDAP project
URL:
Keywords:
Depends on:
Blocks:
 
Reported: 2012-12-13 17:21 UTC by Quanah Gibson-Mount
Modified: 2014-08-01 21:04 UTC (History)
0 users

See Also:

Attachments
Add an attachment (proposed patch, testcase, etc.)

Note You need to log in before you can comment on or make changes to this issue.
Description Quanah Gibson-Mount 2012-12-13 17:21:28 UTC 
Full_Name: Quanah Gibson-Mount
Version: RE24 12/11/2012
OS: Linux 2.6
URL: ftp://ftp.openldap.org/incoming/
Submission from: (NULL) (74.196.25.250)


When testing on a database with over 40,000 subtrees, I discovered that search
results when using subtrees as a base for the search are at least 50x slower
with back-mdb than they are with back-hdb.  Details have been provided to
Howard, including the example dataset
Comment 1 Quanah Gibson-Mount 2012-12-13 17:21:42 UTC 
moved from Incoming to Software Bugs
Comment 2 Howard Chu 2013-01-09 16:37:39 UTC 
moved from Software Bugs to Software Enhancements
Comment 3 Howard Chu 2013-01-27 00:22:53 UTC 
changed notes
changed state Open to Test
Comment 4 Quanah Gibson-Mount 2013-01-27 03:19:04 UTC 
changed notes
changed state Test to Release
Comment 5 Quanah Gibson-Mount 2013-03-05 02:24:40 UTC 
changed notes
changed state Release to Closed
Comment 6 OpenLDAP project 2014-08-01 21:04:56 UTC 
enhanced in master
enhanced in RE24