2013/11/12 Nicolas Barbier <nicolas.barbier@gmail.com>:
> In conclusion, use a “B-forest” when:
>
> * The index entries are small (large fan-out).
> * The insertion throughput is high.
> * It’s OK for look-ups to be slow.
> * Extra points when the storage medium has high seek times.
Oops, forgot the most important ones:
* Insertions are random.
* The total amount of data is very high.
Nicolas
--
A. Because it breaks the logical sequence of discussion.
Q. Why is top posting bad?
