Built my first memory allocator in C This one is just a simple bump allocator, but I'm planning to build one a little more sophisticated this week

I built a device that electrocutes me whenever I bite my nails looking back, this might be my greatest project (didn't break the habit though)

I recently learned that Postgres can store indexes using hash tables instead of B-trees B-tree indexes are the default in Postgres and are generally more versatile (ex: hash indexes only support equality lookups), but it's still cool to know hash indexes are an option

VACUUM in Postgres explained (very simply)

I was reading about Postgres's implementation of merge joins today and did a short experiment A prereq for a merge join is that both inputs are sorted by the join key. If they aren't already sorted (like from an index scan), postgres may need to explicitly sort them. During this sort step, postgres can keep the rows in memory and use an in-mem sort like quicksort. If the sort can't fit within work_mem though, some of that data will actually spill over onto disk and postgres will do an external merge sort instead I tried this with 1 million rows where one query has 4mb of work_mem and the other has 100mb of work_mem. Interestingly, the execution times for both queries weren't that different

Created a basic hash table in assembly so I can solve two sum optimally