[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

libavl 2.0.3 slower than 1.4.1

From: Daniel Brahneborg
Subject: libavl 2.0.3 slower than 1.4.1
Date: Fri, 21 Nov 2014 09:59:56 +0100
User-agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10.8; rv:24.0) Gecko/20100101 Thunderbird/24.6.0


In one of our applications we're using right-threaded AVL
trees from libavl 1.4.1. Now I found version 2.0.3, saw
that red-black trees might be faster, and made some tests.
Version 1.4.1 has worked fine, but better performance is
always welcome. :)

Our data is almost always inserted in order, but sometimes
items needs to be pushed back a bit. Thus, AVL trees. The
only operations we do on this are "insert" and "extract first".

With version 1.4.1 adding 10M items and extracting them
from two threads takes 19 seconds. With the red-black trees
from version 2.0.3 this takes 31 seconds. Shouldn't RB trees
be faster?

Is there another tree type we should use instead?

Your help is greatly appreciated.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]