[Date Prev][Date Next] [Chronological] [Thread] [Top]

Re: AVL -> T-trees

<quote who="Howard Chu">
> Taking a cue from our MySQL friends - MySQL uses T-trees for their
> in-memory
> structures. These are balanced trees, like AVL trees. But instead of just
> one
> data item per tree node, they have N items per node. (Presumably N is a
> compile-time constant.) The advantage to using T-trees is that inserts and
> deletes have less impact on the overall tree, thus minimizing the need for
> rebalancing.
> I would expect that they perform about as well as AVL trees for lookups.
> Anyone interested in experimenting here and reporting on the relative
> performance?

I wonder what PostgreSQL does, as it's much much faster than MySQL.

Kind Regards,

Gavin Henry.
Managing Director.

T +44 (0) 1224 279484
M +44 (0) 7930 323266
F +44 (0) 1224 824887
E ghenry@suretecsystems.com

Open Source. Open Solutions(tm).


Suretec Systems is a limited company registered in Scotland. Registered
number: SC258005. Registered office: 13 Whiteley Well Place, Inverurie,
Aberdeenshire, AB51 4FP.