If you are using oracle, mysql , mssql you are typically using b-tree index. mysql supports hash index but i rarely see it applied in prod (probably just habits or lack of familiarity).
Yes, but a lot of the cool, new DBs use LSM trees. The post we're currently discussing also spends more time explaining LSM trees + WAL, than it does B-trees.
But your point is still valid. :)
> but when you realize you're just adding one tree on top of another you're just masking the problem.
What is the problem and how do you propose to solve it without touching indexes? They are a hard requirement for any decent sized table.