Re: potential rbtree optimizations

[Bruno Haible]

Ondrej Bilka wrote:
> > This means, the data structure would be a balanced tree of small arrays.
> did you mean T-tree? 
> http://www.vldb.org/conf/1986/P294.PDF

Yes! This is exactly what I meant. The T-Tree came out better than the AVL
tree. The timing measurements were done on an old VAX. With nowaday's
CPU architecture that relies heavily on memory caches, there will be
an additional speedup, due to the increased locality of reference.

Bruno