Database internals / systems software / C++

Work that goes below the surface.

I am Bilal Kahraman. I work on database engines and systems code. This site collects project pages and links to their source, design notes, release limits, and demonstrations.

Published here

Four projects, four kinds of systems work.

Open a project to see its current implementation and limits.

PostgreSQL extension experiment First release: 0.1.0

jsonb_slice

Can PostgreSQL read one field from a large jsonb value without reading the complete value?

Version 0.1.0 provides an installable extension shell and defines the research question. It has no JSONB accessor or performance claim.

Current version boundary
CREATE EXTENSION jsonb_slice;
Real-time communication platform C++ / Protobuf / LiveKit

Kergit

A Discord-like text and voice system designed around a C++ signaling core.

Kergit keeps sessions, state synchronization, backpressure, and voice ownership server-authoritative while LiveKit handles the media plane. The project page explains the architecture and its current prototype boundary.

session_trace connected
AUTH → session
STATE_SYNC ← hubs · channels
VOICE_JOIN → channel alpha
VOICE_TOKEN ← node · key · resume
clientC++ coreLiveKit
Raycasting game engine C++ / SDL

Last Signal from Karakale

A Wolfenstein-style engine built to study real-time rendering, navigation, and game state.

The engine uses DDA raycasting, A* pathfinding, and state-based enemy behavior. The project page presents the engine and keeps the source available for inspection.

Raycasting view
Abstract raycasting scene A corridor is formed by wall planes that meet at a distant point.
Path planning library C++ / SDL / yaml-cpp

Path Planning

Five ways across a map: A*, BFS and DFS on the grid, RRT and RRT* through free space.

Each planner is a C++ class behind one planning interface. The grid searches share a common base, RRT and RRT* share a tree, and every run logs the nodes it explored for the SDL visualizer to draw. On the project page, place a start and a goal on a benchmark map or a maze, run a planner, and watch it search.

Sampled path
Abstract path planning scene A tree of short segments grows from a start point around three walls, and a path through the tree reaches the goal.

How to read this site

The boundary is part of the work.

01

Start with the project page

Each project states what it does before it asks you to read the code.

02

Check the current boundary

Project pages separate implemented paths from experiments and active work.

03

Follow the source

The implementation and its history stay close to the explanation.