Mailing-List: contact dev-help@directory.apache.org; run by ezmlm
Precedence: bulk
Reply-To: "Apache Directory Developers List" <dev@directory.apache.org>
Received-SPF: pass (athena.apache.org: domain of elecharny@gmail.com
 designates 74.125.82.178 as permitted sender)
Message-ID: <4E9D1E42.1000109@gmail.com>
Date: Tue, 18 Oct 2011 08:35:46 +0200
From: Emmanuel Lecharny <elecharny@gmail.com>
Reply-To: elecharny@apache.org
User-Agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.6;
 rv:7.0.1) Gecko/20110929 Thunderbird/7.0.1
MIME-Version: 1.0
To: Apache Directory Developers List <dev@directory.apache.org>
Subject: Lookup operation performance with the modified JDBM
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit

Hi guys,

I have done some profiling to see why we get a really slower processing 
of operations like lookup or search with the new JDBM code base : we 
always copy the value we get back from the JDBM partition, which means 
we deserialize entries or dns.

Deserializing is an awfully costly operation. The result is that we get 
a 7 times slower lookup (5000/s against 35000/s before) doing a copy for 
each entry we return.

I have no idea if we can avoid doing such a copy, I just wanted to know 
where we were spending time for such an operation.

-- 
Regards,
Cordialement,
Emmanuel Lécharny
www.iktek.com