Viewing profile — bddicken
bddicken
HN member- Joined
- Tue, Aug 14, 2012, 10:10 PM UTC
- HN karma
- 483
- Public activity
- 153 items
- HN profile
- View on Hacker News ↗
About bddicken
Also benjdd.com
Recent public activity
-
comment
Comment #49164072
pgBaseBackup seems very cool. It's great that they got support to continue building. We just don't use it presently.
-
comment
Comment #49162651
Neki will support cross-shard ACID transactions with a combination of an external transaction coordinator and some changes to PostgreSQL itself to support this (either by engine mo…
-
comment
Comment #49161628
Exactly. When you have a router + query parser in front of the db nodes, the burden of managing multiple versions simultaneously can be taken out of the app and into the database l…
-
comment
Comment #49161510
Broadly for Pg, minor version upgrades are straightforward as the data on disk is guaranteed to be compatible. All it takes is a restart or switchover to upgrade. Major versions ar…
-
comment
Comment #49160316
What I emphasized in this article (author here) is scaling postgres backups. This works because there's already rock-solid systems built into postgres + surrounding tooling to buil…
-
comment
Comment #48935718
Author here, thank you. Technically, they are using js + gsap + svg embedded i the article with iframes. Process-wise, I drafted most of them as static images in excalidraw, passed…
-
comment
Comment #48935677
Very welcome
-
comment
Comment #48935674
Yep! https://vitess.io/docs/reference/features/distributed-transa...
-
comment
Comment #48935597
We have tons of customers who do exactly this. It's great. Sharding is for customers who out grow this path.
-
comment
Comment #48935558
A lot of what you're referring to is dictated by the sharding strategy. Vitess and Neki both let you configure this via the VSchema / data topology (That's what I'm getting at here…
-
comment
Comment #48935499
You should read through those articles.
-
comment
Comment #48935467
> So an extreme example is OpenAI needing 50 replicas, but we're doing five blades ... err, we're doing 768 servers because the need arose "pretty quickly"? If you read the OpenAI …
-
comment
Comment #48935370
Hey, author here. Technically, they're powered by js + gsap + svg. Process wise (for most of them) I sketched them out in advance in excalidraw for figure out layout, then passed t…
-
comment
Comment #48935292
Spreading requests out across hundreds, thousands, and in some cases even more is precisely what is done in the industry for big databases! Good examples: cashapp: https://code.cas…
-
comment
Comment #48927716
Caching at all levels is key to good db performance (cpu cache ram disk). CPU cache optimization is not my area of expertise, but I did write another fun article on io devices and …
-
comment
Comment #48927100
Hey, I wrote this! Sharding is cool and foundational to making the internet work. I'm around to answer Qs.
- story
- story
-
comment
Comment #47758696
It may not have the popularity it once did, but MySQL still powers a huge % of the internet.
-
comment
Comment #47758687
What about spanner specifically benefits from random ids over sequential ones?
-
comment
Comment #47758338
Simple sequential IDs are great. If you want UUID, v7 is the way to go since it maintains sequential ordering.
- comment
-
comment
Comment #47757971
I've also written about sharding. https://planetscale.com/blog/database-sharding
-
comment
Comment #47757860
B+trees combined with sequential IDs are great for writes. This is because we are essentially just appending new rows to the "linked list" at the bottom level of the tree. We can a…
-
comment
Comment #47757625
It's really just a matter of tradeoffs. B-trees are great, but are better suited for high read % and medium/low write volume. In the opposite case, things like LSMs are typically b…