This article explains why multi‑way search trees such as B‑trees, B+‑trees, B*‑trees and R‑trees are crucial for reducing disk I/O in large‑scale storage systems, covering their hardware background, structural definitions, height analysis, insertion and deletion algorithms, and practical examples with code and diagrams.
This article provides a comprehensive overview of B‑tree, B+‑tree, B*‑tree and R‑tree data structures, explaining their definitions, node layouts, height analysis, insertion and deletion algorithms with examples, and their roles in external‑memory indexing for databases and file systems.
This article details the design and implementation of a Go‑based backend for a ride‑hailing app, covering real‑time vehicle tracking, route planning with OSRM, bandwidth‑saving UDP + ProtoBuf communication, in‑memory storage, R‑tree indexing, and the full API workflow.
This article describes how a ride‑hailing service built a memory‑based backend that animates cars on a map, covering challenges of sparse GPS updates, route planning with OSRM, protocol selection (UDP), data serialization (Protobuf), storage architecture, geospatial indexing with R‑tree, and the final API design.
The article explains how geo‑fencing relies on fast point‑in‑polygon checks, compares the basic ray‑casting method with brute‑force performance, and shows how spatial R‑tree indexing—both on polygon bounding boxes and on individual edges—dramatically speeds up queries even for millions of complex polygons.
