/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.
You are here

davquar.it
| | thomasvilhena.com
2.3 parsecs away

Travel
| | [AI summary] A review of four major consensus protocols-Chandra-Toueg, Ben-Or, Paxos, and Nakamoto-accompanying implementations in C#.
| | harry.me
3.6 parsecs away

Travel
| |
| | speakerdeck.com
5.2 parsecs away

Travel
| | An introduction to Raft and its implementation in java, Barge.
| | rcoh.me
24.9 parsecs away

Travel
| 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.