Hi, Can you share reasons to change list implementations? >
Do you mean why I switched from the "skip list" to a "AVL tree" and then to a "B-tree"? Yes. I implemented the skip list algorithm because it was new to me (so - not because of concurrency or so). Then I switched to AVL tree because it was faster for in-memory operations. Then I switched to B-tree because it was faster for disk based operations (actually it is not much slower for in-memory operations either). My skip list implementation was relatively slow and used more memory. Some recent research says B-trees are good for in-memory use. Regards, Thomas -- You received this message because you are subscribed to the Google Groups "H2 Database" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/h2-database?hl=en.
