I thought the universal practice for getting good performance for relational dat... | Hacker News

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

mark_l_watson on Oct 15, 2022 | parent | context | favorite | on: Postgres Full Text Search vs. the Rest

I thought the universal practice for getting good performance for relational databases, RDF, other graph, etc. data stores is to be able to hold indices in memory.

sroussey on Oct 20, 2022 [–]

Yes, but paged b-trees are more graceful when they can’t fit in memory—which was the default when I cut my teeth on databases.

It’s also a reason why MyIsam separated data and index files. InnoDb is a clustered index, so all the data is packed next to the primary key.

Consider applying for YC's Fall 2026 batch! Applications are open till July 27.
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact