quick glance about performances?

[benoitc]

Hi,

I had a quick view about the performance file, but not sure how to compare it to te perfs of gb_tree. Can you give more info about it. In a more general manner, do you see any performance optimisations that could be done yet?

[walter-weinmann]

In the WiKi area, there is a MS Excel file with numbers for performance (Performance_10000.xlsx). Each line in this file represents a function that was executed 10 000 times (except the lines starting with largest _... and smallest_...), eg lookup_gb_tree_test stands for the function gb_trees: lookup/2 or lookup_b_tree_order_256_test stands for the function b_trees: lookup/2 for a b-tree with order 256.

Considering these numbers then one should proceed with a possible performance optimization in the following order:

1. take_any/2      (= is_defined/1 + take/2)
2. delete/2
3. take/2          (= lookup/2 + delete/2)
4. enter/3         (= is_defined/2 + (update/3 or insert/3)
5. take_largest/1  (= largest/1 + delete/2)
6. take_smallest/1 (= smallest/1 + delete/2)

So clearly delete/2 should be optimized first and insert/3 second. These are also the most complex functions.