tmulcahy

What about it isn't well engineered?

I usually code with VIM. I work in many different languages and repos simultaneously. Python, TypeScript, C++, Kotlin, etc. Sometimes I need to ssh into a server and code there because I can't build AOSP on my Mac laptop. I sometimes find autocomplete helpful, but I can't be bothered to keep it working across all of these environments.

Agreed. This is the best explanation of Log-Structured Merge Trees I've seen. I finally feel confident that I understand the concept.

Slide rules seem really cool! I'd like to acquire one for my desk. Anyone have recommendations for particular models or features? And where I can buy one? I'm hoping to get one in good condition, easy to use, and not to expensive. Bonus points if there is some cultural significance like the Pickett that the Apollo program used.

Thanks for the explanation. Very interesting! I assume you only do the DFS when you detect a lock ordering violation? So if there is the potential for a deadlock you'll do extra work to make sure that you're actually deadlocked before aborting?

Any details/links that explain this? The article seems to suggest that they used to detect the deadlock as it was about to happen, and then abort everything and retry. This doesn't seem too different from "when they happen". What is the optimization?

> The lock ordering rules had become too complicated and this was getting us too many transaction restarts, so I stole the standard technique from databases

What is the standard technique from databases?