/explore
|
You are here 
|
benjamincongdon.me | ||
| | | | |
planetscale.com
B-trees are used by many modern DBMSs. Learn how they work, how databases use them, and how your choice of primary key can affect index performance. |
|
| | | | | ||
| | | | |
abseil.io
Battle-tested, Mom-approved |
|
| | | | | ||
| | | | |
siemens.blog
[AI summary] The author explains the internal mechanics of database storage engines by implementing slotted pages in C, which manage data organization and free space more efficiently than simple linear layouts. |
|
| | | | | ||
| | | | |
robertovitillo.com
Coordination is expensive as it reduces the availability and performance of distributed applications (PACELC theorem). I have extended chapter 10 of Understanding Distributed Systems with a discussion of how to minimize coordination using one of the following patterns: Keep coordination off the critical path Use protocols that guarantee some form of consistency without coordination Proceed without coordination and apologize when an inconsistency is detected Section 10.4 describes chain replication, a wid... |
|
| | | |||
