Skip to main content

Practicing zone of proximal development

I was at a LIVE tech conference last week! The keynote was about learning through tinkering. The talk had a chapter that resonated with me quite profoundly: the zone of proximal development. Essentially, it means a student can only learn something "around" a given subject if the topic is familiar to them.

As I've written here a few times, one of the pieces of technology close to my heart is Postgres (and RDMSs in general). I know the basics + some more and can tune some common knobs. Having said that, database internals present a fascinating mystery. I don't understand how they work under the hood - not even close. 

I believe that delving into the details and getting hands-on experience can take my understanding to a whole new level. This is the essence of the zone of proximal development - learning by doing and pushing the boundaries of what we already know.

I stumbled upon the Carnegie Mellon university database lecture series in some of the investigatory rabbit holes. It starts from the fundamental algorithms of how most databases work. Again, very cool, but can I get even the gist of them by watching YouTube videos? The answer is a harsh no. Glancing over some videos barely scratches the surface.

That's why I started to supply the graveyard of side projects with a fresh corpse. This time it is a key-value store. Can you think of a more wonderful project? Honestly, there are some pretty interesting problems to solve there, at least if you are really nerdy! 🤓

Why a key-value store if I am interested in Postgres? 

The answer is ingrained in the practice of zone of proximal development. Learning about RDS internals is only possible if I know the basics. If you squint your eyes a bit, a relational database is a key-value store. Sure, there is the whole query language thingy, but I need help grasping it. I must know the foundation on which those algorithms are built.

In short, I've implemented a linear hashing KVS with a simplistic implementation of how data is persisted to disk. That means 4K pages, page directory, page buffer, LRU cache, free pages, etc. I also intend to be mindful of excess allocations, handle mostly raw byte arrays, and occasionally benchmark the thingy. All of these are present in Postgres on some level but, of course, in a more sophisticated form.

It is in it's early days but here is the repository

https://github.com/jjylik/aapari


Comments

Popular posts from this blog

I'm not a passionate developer

A family friend of mine is an airlane pilot. A dream job for most, right? As a child, I certainly thought so. Now that I can have grown-up talks with him, I have discovered a more accurate description of his profession. He says that the truth about the job is that it is boring. To me, that is not that surprising. Airplanes are cool and all, but when you are in the middle of the Atlantic sitting next to the colleague you have been talking to past five years, how stimulating can that be? When he says the job is boring, it is not a bad kind of boring. It is a very specific boring. The "boring" you would want as a passenger. Uneventful.  Yet, he loves his job. According to him, an experienced pilot is most pleased when each and every tiny thing in the flight plan - goes according to plan. Passengers in the cabin of an expert pilot sit in the comfort of not even noticing who is flying. As someone employed in a field where being boring is not exactly in high demand, this sounds pro...

PydanticAI + evals + LiteLLM pipeline

I gave a tech talk at a Python meetup titled "Overengineering an LLM pipeline". It's based on my experiences of building production-grade stuff with LLMs I'm not sure how overengineered it actually turned out. Experimental would be a better term as it is using PydanticAI graphs library, which is in its very early stages as of writing this, although arguably already better than some of the pipeline libraries. Anyway, here is a link to it. It is a CLI poker app where you play one hand against an LLM. The LLM (theoretically) gets better with a self-correcting mechanism based on the evaluation score from another LLM. It uses the annotated past games as an additional context to potentially improve its decision-making. https://github.com/juho-y/archipylago-poker

Careful with externalTrafficPolicy

On a project I am working on is hosted in an EKS cluster with the NGINX ingress controller (the one maintained by Kubernetes). It is deployed using it's official official Helm chart, which I realized, after a lengthy debugging session, was a mistake. The initial setup I aimed to improve had several flaws. Firstly, we were using the AWS Classic Load Balancer in front of the nginx ingress in the cluster, which has been deprecated for some time (years?). Continuing to use it makes little sense to us. The second issue was that we were only running one(!) nginx pod, which is quite sketchy since the exposed web services had essentially no high availability.  I switched to the Network Load Balancer (NLB), which was straightforward - I just needed to change the ingress-nginx service annotation to specify the load balancer type as NLB: service.beta.kubernetes.io/aws-load-balancer-type: nlb However, increasing the replica count turned out to be tricky. When I bumped it up to two, I began to ...