|
You are here |
orib.dev | ||
| | | | |
benjamincongdon.me
|
|
| | | | | B-Trees are not boring, after all | |
| | | | |
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. | |
| | | | |
ordep.dev
|
|
| | | | | [AI summary] A transcript of a talk comparing log-structured storage engines like LSM-Trees with traditional B-Trees, discussing their architectures, performance trade-offs, and underlying data structures. | |
| | | | |
modern-sql.com
|
|
| | | LISTAGG is the new SQL standard version of GROUP_CONCAT or STRING_AGG. LISTAGG supports DISTINCT and provides an ON OVERFLOW clause to control the behavior when exceeding the maximum string length. | ||