News for hackers. Stuff that matters.
Re:How does a B-tree make queries fast? by wruza on Sunday December 24, 2023 @07:35AM (#38753073)
You could envision a simple db format where indexes and the main row file are stored in separate files

They already envisioned it in DBF and CDX.

Re:How does a B-tree make queries fast? by RaftPeople on Sunday December 24, 2023 @12:16PM (#38754897)
This is how systems handled it before relational was widely adopted, for example the IBM System 36.