In early October 2026 I posted a series of replies on X that mixed leadership commentary about MongoDB’s interim CEO, technical critiques of in‑memory map implementations, and moderation actions against bot accounts. The thread captures my view that leadership legacy matters more than compensation, and that cache‑friendly data structures outperform classic red‑black trees.
- Leadership turnover: CJ oversaw roughly ~5,500 MongoDB employees and left after 10 months for a higher‑pay role.
“At the end of the day, no one's going to remember how much money you make. They're going to remember what kind of leader you were and what kind of person you were.”
- Technical claim: “in‑memory ordered maps are a cache line problem, not a big‑O problem; a red‑black node costs a dependent load per level; a b‑tree node amortizes one miss across many keys, so same log n, far fewer stalls.”
- Structures compared: std::map (red‑black tree), B‑tree, and Swiss Table.
- Projects mentioned in the critique: GIMP, Gmail backend, Colossus, CockroachDB.
- Blocked bot URLs: https://t.co/QU3zCl3d27, https://t.co/ra8ApTzxS3, https://t.co/ccVShWA9OG, https://t.co/ftout6DGVD.