|
You are here |
planetscale.com | ||
| | | | |
surfingcomplexity.blog
|
|
| | | | | I've been reading Alex Petrov's Database Internals to learn more about how databases are implemented. One of the topics covered in the book is a data structure known as the B-tree. Relational databases like Postgres, MySQL, and sqlite use B-trees as the data structure for storing the data on disk. I was reading along with... | |
| | | | |
architecturenotes.co
|
|
| | | | | How Relational Databases Work. This post talks about how indexes and transactions work on the inside of relational databases. | |
| | | | |
rcoh.me
|
|
| | | | | Many software engineers use database indexes every day, but few of us really understand how they work. In this post I'll explain: How indexing works in Postgres using B-Trees What B-Trees are Why they are a good fit for this problem Indexes in Postgres Postgres actually offers 4 different kinds of indexes for different use cases. In this post I'll be focusing on the "normal" index, the kind you get by default when you run create index. | |
| | | | |
lucianonooijen.com
|
|
| | | How to best handle SQL logic in Golang applications for migrations and queries | ||