title: Does B+-tree have any advantages for an in-memory database compared to Hash if no range query is needed?
body: <p>If both are well designed and programmed.
  Does B+-tree have any advantages for an in-memory database compared to Hash if no range query is needed?</p>