Why databases use ordered indexes but programming uses hash tables
> Why is the "default" choice different between programs and databases, when at the end of the day they both do the same thing: accessing data for our code?<p>Because databases are designed to be efficient at scale. A hash table just doesn't have the functionality that a database with a B-tree variant does.