15 Sep
2010
15 Sep
'10
6:23 p.m.
On Wed, Sep 15, 2010 at 12:15 PM, Giorgio Zoppi <giorgio.zoppi@gmail.com> wrote:
So you plan to code B-Tree, B*Tree, B+tree. ...
I use the term "B-tree" as the generic name, as is the usual practice in the literature.
The particular implementation is a B+ tree with leaf pages in a doubly linked list. But I consider that an implementation detail subject to change. Single link lists have concurrency advantages. My C implementation used no linked lists at all to advantage. It would be interesting see how in this case could work skip-lists in term of time and concurrency. Best Regards -- Quiero ser el rayo de sol que cada día te despierta
2010/9/15 Beman Dawes <bdawes@acm.org>: para hacerte respirar y vivir en me. "Favola -Moda".