cartero Tuesday, August 11, 2026 · No. 25887
Query Planning

Using Resource score with consistent Hashing in distributed databases

So in order to learn more about the working of the distributed databases I read a few research papers of dynamodb, cockroachdb, gfs etc.., but I wanted to build something from this theory that I learned for indepth learning. Irisdb is a fault tolerant database written in golang. It uses consistent hashing with resourceScore to determine the load/slot ranges assigned to each of the node in the cluster. The project uses pebble as the data storage layer, initially I was planning to use rocksdb b...

OCaml

The feature in OxCaml that more languages should steal

OxCaml, Jane Street's superset of OCaml, allows you to assert that entire call trees do not allocate on the heap with [@zero_alloc].This turns the typical process of profiling to find hot spots backwards, allowing you to track down every single allocation you might care about in a hot loop.