[ANN] BB-Tree package
Matej Košík
kosik at fiit.stuba.sk
Tue Dec 27 17:01:17 UTC 2005
-----BEGIN PGP SIGNED MESSAGE-----
Hash: SHA1
Philippe Marschall wrote:
>>I have found out that sorted-collection are more effective than BB-trees
>>when there are fewer elements in the collection (1000 or so). But as
>>number of elements in the collection increases (to 100000 or so), it is
>>evident that BB-tree rulez. There is an example method
>
>
> I, and probably others too, am very interested in (speed) comparisons
> against Avis BTree for OODBs like GOODS.
>
Hi,
I have found out that Avi's B-Tree works 2 or 3 times faster than my
BB-Tree. So noone needs to hurry to use BBTree instead of BTree :)
Here are my results of comparison:
http://altair.dcs.elf.stuba.sk/wiki/Kosik/BBTree#Differences
B-tree and BB-tree implementation also differs in this respect
http://altair.dcs.elf.stuba.sk/wiki/Kosik/BBTree#sortBlock
but B-trees could use this approach too. It would slow operations down
(executing some binary block in order to compare two elements) takes
longer than comparing two integers by `<'.
- --
Matej Košík
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1.4.1 (GNU/Linux)
iD8DBQFDsXNdj6wbCo2ZNGIRAtM3AKCSSVliPRPQPl9Ywol1UoyhbVazRwCeIwgl
YdGhh5pz7fVVSHgSyU1Gsqs=
=79Nh
-----END PGP SIGNATURE-----
More information about the Squeak-dev
mailing list
|