← Quit0 / 0 correct
Data StructuresHard1 of 407

What advantage does a B-tree have over a hash index for an in-memory database index?