Recent Blog Posts
Insights on AI Agents, Modern Web, and the Future of Engineering.
Building a Self-Organizing Agent Swarm with Google ADK
How to build a declarative, self-expanding multi-agent system with Google ADK that spawns and persists its own specialists at runtime.
Cosine Similarity, Dot Product and Euclidean Distance: Choosing a Metric
Compare cosine similarity, dot product, and Euclidean distance for vector search, and learn when each metric is the right choice.
Dense Vector Embeddings Explained for Backend Engineers
A practical explanation of dense vector embeddings: how they are generated, what their dimensions mean, and how backend systems store and query them.
From Keyword Matching to Semantics: How Similarity Search Changes Retrieval
See how retrieval evolved from exact keyword matching to semantic similarity search, and what each approach is still good at.
What Is a Vector Database and Why Embeddings Need One
Learn what a vector database is, how it stores high-dimensional embeddings, and why traditional databases struggle with similarity search.
Anisotropy in Embedding Spaces and Its Effect on Retrieval Quality
What anisotropy in embedding spaces is, why all sentences seem 'similar' in raw BERT embeddings, and how it degrades retrieval quality.
Approximate vs Exact Nearest Neighbour Search: The Core Trade-Off
Why exact nearest neighbour search does not scale, how approximate search trades a little recall for massive speed, and how to choose.
How to Benchmark Vector Databases Honestly
A checklist for benchmarking vector search fairly: ground truth, real queries, comparable settings, and the traps that make vendor numbers meaningless.
Brute-Force Scans: When Linear Search Is Actually the Fastest Option
Why exhaustive vector scans still beat ANN indexes for small to medium corpora, and how SIMD makes brute force surprisingly competitive.
Filtered Vector Search and the Pre-Filter vs Post-Filter Problem
Why metadata filters break naive vector search, the difference between pre-filtering and post-filtering, and how databases handle both.
HNSW Explained: Hierarchical Navigable Small World Graphs
How the HNSW index works: multi-layer navigable small-world graphs, greedy descent, and why it dominates modern vector search.
HNSW Parameters: M, efConstruction and efSearch Tuning
A practical guide to tuning HNSW parameters: what M, efConstruction and efSearch do, how they trade memory, build time, recall and latency.