lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  PHC 
Open Source and information security mailing list archives
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date:	Sat, 1 Nov 2008 10:17:41 +0000
From:	Sean Young <>
To:	Joern Engel <>
Subject: Re: [RFC] B+Tree library

On Sat, Nov 01, 2008 at 12:36:15AM +0100, Joern Engel wrote:
> On Fri, 31 October 2008 20:17:45 +0000, Sean Young wrote:
> > On Sun, Oct 26, 2008 at 01:46:44PM +0100, Joern Engel wrote:
> > > General advantages of btrees are memory density and efficient use of
> > > cachelines.  Hashtables are either too small and degrade into linked
> > > list performance, or they are too large and waste memory.  With changing
> > > workloads, both may be true on the same system.  Rbtrees have a bad
> > > fanout of less than 2 (they are not actually balanced binary trees),
> > > hence reading a fairly large number of cachelines to each lookup.
> > 
> > Which reminds me:
> > 
> > find_vma() uses rbtrees. Now I assume find_vma() is called far more than
> > mmap() and friends. Since avltree are balanced (unlike rbtrees) lookups
> > will be faster at the expense of extra rotations during updates.
> Maybe I should have been clearer.  Rbtrees _are_ balanced trees.  They
> are not balanced _binary_ trees, but balanced 234-trees in a binary
> representation.

I should have been more clearer. avltrees are more rigidly balanced than
rbtrees, making them faster for lookups but slower for modification:

The difference between the shortest path to a leaf node and the longest 
path to a leaf node is +1 for avl and *2 for red-black.

To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to
More majordomo info at
Please read the FAQ at

Powered by blists - more mailing lists