Artjom Plaunov

In this post I’m going to give a very casual overview of the ART (adaptive radix tree)1 data structure used for indexing in DuckDB. 2 This is mainly to give a feel of the data structure as a whole without any concerns for how it is integrated into the dat…

In the last two sections, we went over how TUN devices work, and I showed some local network setup that allows two tun devices to forward packets between each other.

As I set out to implement TCP in OCaml, I ran up against a very simple problem: where should it go?

I am working through the MIT distributed systems lab, and I wanted to share my experience and post on some cool things that I’ve been learning.

Welcome back to part 2 of this series, in which we are implementing a disk backed B+ tree.

In this series we will be implementing a disk based B+ tree in OCaml.

Part 4 covered two big topics: registering optimization passes and setting up a JIT to compile our code on the fly.

Before moving onto chapter 4, let’s tinker with the code we have so far.

Hello again!

I am currently looking at chapter 3 of the LLVM Kaleidoscope Language tutorial, where a simple language called Kaleidoscope is implemented to learn about how LLVM works.

I want to start this blog post with a quick TL;DR before I get into musings – this post is about a rewrite of Edward Sciore’s simple DB from the book “Database Design and Implementation”, which is originally in Java, but we ported (a good chunk of it) to…

Hello world!