Breath-First Search using Stack
1. BFS using Queue Just in the prior post on graph traversal, we went into details of Depth-First Search (DFS) and Breadth-First Search (BFS). BFS is a way of traversing down the graph, level-by-...
Graph Theory: Search and Traversal
0. Graph Traversal Breadth-First Search (BFS) and Depth-First Search (DFS) are two of the most commonly used graph traversal methods. The traversal of a graph, whether BFS or DFS, involves two ma...
Graph Theory: Introduction
Before heading into details of how we store, represent, and traverse various kinds of graphs, this post is more of a ramp-up to better understand what graphs are and the different kinds from a co...
Spatial Index: R Trees
In this post, let's explore the R-Tree data structure, which is popularly used to store multi-dimensional data, such as data points, segments, and rectangles. 1. R-Trees and Rectangles For ...
Spatial Index: Tessellation
Brewing! this post a continuation of Spatial Index: Grid Systems where we will set the foundation for tessellation and delve into the details of Uber H3 0. Foundation Tessellation or tiling is t...
Spatial Index: Grid Systems
This post is a continuation of Stomping Grounds: Spatial Indexes, but don’t worry if you missed the first part—you’ll still find plenty of new insights right here. 3. Geohash Geohash: Invented ...
Spatial Index: Space-Filling Curves
0. Overview Spatial data has grown (/is growing) rapidly thanks to web services tracking where and when users do things. Most applications add location tags and often allow users check in specifi...
Real-time insights: Telemetry Pipeline
0. Overview 0.1. Architecture A telemetry pipeline is a system that collects, ingests, processes, stores, and analyzes telemetry data (metrics, logs, traces) from various sources in real-time or...
B Trees and B+ Trees
0. Foundation Disk Structure Let's start with disk structure. It's a platter with concentric circles, which are logical not physical. These circles of different radii are called tracks, ...