Hacker News new | ask | show | jobs
by gtrubetskoy 4687 days ago
It needs to store rows in order to support indexes, so that a row could be found without having to scan the whole table, and that's exactly what B-Trees let you do, and also add or remove rows without having to rewrite the whole table, but only affected blocks.
1 comments

What you say, isn't that more or less exactly what I wrote?