|
You are here |
davquar.it | ||
| | | | |
thomasvilhena.com
|
|
| | | | | [AI summary] A review of four major consensus protocols-Chandra-Toueg, Ben-Or, Paxos, and Nakamoto-accompanying implementations in C#. | |
| | | | |
harry.me
|
|
| | | | | ||
| | | | |
speakerdeck.com
|
|
| | | | | An introduction to Raft and its implementation in java, Barge. | |
| | | | |
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. | ||