*You could envision a simple db format where indexes and the main row file are s... | Hacker News

Hacker Newsnew | past | comments | ask | show | jobs | submit

		wruza on Dec 24, 2023 \| parent \| context \| favorite \| on: How does a B-tree make queries fast? 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.

RaftPeople on Dec 24, 2023 [–]

This is how systems handled it before relational was widely adopted, for example the IBM System 36.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact