Indexes (usually B+ trees, sometimes hash tables) speed up lookups at the cost of extra storage and slower writes.
Loading subject content…
Loading subject content…
Loading practice questions…
Indexes (usually B+ trees, sometimes hash tables) speed up lookups at the cost of extra storage and slower writes.