ClickHouse Internals

Internals

ClickHouse is an open-source, column-oriented database for real-time analytics. Written in C++ and ships as a single binary. Queries run on a vectorized execution engine, and the MergeTree family of table engines is the main storage format.

ClickHouse started in 2009 at Yandex as a filter and aggregation operator for web-scale log data, the click records of the Yandex.Metrica web analytics service. It was open-sourced in 2016.

Apache Kafka Internals

Internals

How Apache Kafka works internally, making sense of its many configurations across the event stream, brokers, and best practices for running a...

Graph Theory: Search and Traversal

Graph Theory

Understanding BFS and DFS graph traversal, the difference between visiting and exploring a node, with implementations and examples.

Spatial Index: R Trees

Spatial Index

A deep dive into the R-tree, the data-driven spatial index built on bounding rectangles, and how it powers range and nearest-neighbor queries....

Apache Doris Internals

Internals

A detailed breakdown of Apache Doris, the MPP real-time data warehouse that speaks the MySQL protocol, covering its storage engine, meta service,...

Apache Flink Internals

Internals

Tracing a single Flink job end to end through the Client, JobManager, and TaskManagers to understand Flink's architecture, choosing depth over breadth....

Breath-First Search using Stack

Graph Theory

Implementing breadth-first search with a stack instead of the usual queue, and what changes when you flip the underlying data structure.

Graph Theory: Introduction

Graph Theory

A diagram-first introduction to graph theory from a computer science angle, covering what graphs are, the different kinds, and their real-world uses....

Spatial Index: Tessellation

Spatial Index

Tessellation for spatial indexing divides space into non-overlapping shapes for efficient data management. The Uber H3 grid system uses hexagonal cells, offering...

The Spatial Index

A four-part field guide to multi-dimensional indexing, read best in order.

  1. No. 01 Space-Filling Curves Spatial indexes optimize multi-dimensional data querying using space-filling curves like Z-order and Hilbert curves. Z-order curves employ a...
  2. No. 02 Grid Systems Grid systems in spatial indexing, including Geohash and Google S2, encode geographic locations for efficient spatial data management....
  3. No. 03 Tessellation Tessellation for spatial indexing divides space into non-overlapping shapes for efficient data management. The Uber H3 grid system...
  4. No. 04 R Trees A deep dive into the R-tree, the data-driven spatial index built on bounding rectangles, and how it powers...