Are you googling the questions “How to create a compiler in Java?”, “Tiny compiler in Java?”, “AST to Java bytecode”. Then you are in the right place. The word Tiny is subjective. But yeah, the code is simple enough to understand the end-to-end flow of compiler development. Talk is cheap. Show me the code! There you go…

NOTE: Before starting, the codebase doesn't have Level-based/Size-based SST compaction. So, the SST files reside in Level 0. But, this would anyways be a good starter for learning WAL, Memtable, ImmutableMemtable, and SSTable. It also doesn’t have Bloom Filters. These days, I am reading more database codes, than writing any…

While the RheaKV work is unfinished, I was exploring study resources from other contributors. I got introduced to TinyKV & TinySQL offered by the PingCAP team. This was written in Go and apparently, Go had more market value than Rust. Learning Go was getting prioritized on my to-do list. I…

Today, we will be using our GoLang skills to solve a few easy LC problems. The learning curve of GoLang has been very less. It is super fun and easy to write golang code. Let's jump right into it. 1. Palindrome Number 2. Valid Parenthesis

Today, I am starting my first LC series in Go. The problems in this series are already covered in the RUST series. It is just that, the problems will be solved in GoLang instead of RUST. On the way, we will also cover concepts that are learned in the problem described. Problem: Two Sum - LeetCode Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to…leetcode.com

Though I used golang in the past for development, it is been a while since I actively used it. At present, I see the need to revamp my skills and get myself to revisit golang. So from here on, I will be focusing on GoLang. Learning RUST is paused for…

Today, I moved out to a new place. The entire day was spent mostly shifting. Couldn’t focus much on the DB side of things. Anyways, completing the LC streak. This is a well-known problem called hamming distance. Problem: Number of 1 Bits - LeetCode Write a function that takes an unsigned integer and returns the number of '1' bits it has (also known as the Hamming…leetcode.com Logic: The above logic is used in the Fenwick tree.

This is an interesting problem. Here we will be implementing a MinStack struct. Taking a step back, I started this rust journey 17 days back. Back then, rust was a bit hard to learn, and understand. But then, day by day, I progressed to read rust code, solve LC using…

Hopefully, this will conclude the exploration into mini-redis. The topic would mainly focus on the command folder. cmd/mod.rs convert the frame to Command object apply() the command get_name() returns the command name cmd/get.rs new key (GET specific function) parse_frames (called in from_frame inside mod.rs) apply (command pattern apply) into_frame (…