title: Ordered Linked List vs B-Tree
body: <p>If you have a b+ tree as an index, then this seems to be very similar to a ordered linked list. But the ordered linked list seem to have some advantages, such as not having to navigate a tree structure and also not having to rebuild nodes when they get full, and not having to rebuild the tree when it gets unballanced.</p>
  
  <p>Can anyone answer what is the reason for using a b-tree rather than an ordered linked list?</p>