Santosh Mahale writes that most teams default to vector-database RAG without evaluating whether it fits their data and query patterns, when the retrieval architecture is the primary lever for production success. He compares three options—Traditional (semantic search via embeddings), Vectorless (exact lookups via SQL, BM25, APIs, or graph traversal with no vector store), and Hybrid (both retrieval paths merged and reranked)—and recommends starting with the simplest approach that solves the use case, measuring where it fails, then adding complexity only where data demands it.
- Most RAG failures are retrieval failures (wrong context reaching the LLM), not model failures
- Vectorless RAG is underused; structured-data workloads like log analysis, K8s event lookups, and compliance records often outperform Traditional RAG with far less infrastructure
- Hybrid RAG is the eventual landing spot for most enterprise deployments but adds two retrieval paths, a merge step, and a reranker to maintain
- The article positions RAG variants within a broader stack: LLM → RAG architectures → agents → MCP → agentic systems, each solving a different layer
- Most RAG failures are retrieval failures (wrong context reaching the LLM), not model failures
- Vectorless RAG is underused; structured-data workloads like log analysis, K8s event lookups, and compliance records often outperform Traditional RAG with far less infrastructure
- Hybrid RAG is the eventual landing spot for most enterprise deployments but adds two retrieval paths, a merge step, and a reranker to maintain
- The article positions RAG variants within a broader stack: LLM → RAG architectures → agents → MCP → agentic systems, each solving a different layer
This article explores techniques for optimizing Retrieval-Augmented Generation (RAG) systems by implementing hybrid search and re-ranking mechanisms. It details how to combine dense vector embeddings with sparse keyword matching, such as BM25, to improve retrieval accuracy, followed by the use of a cross-encoder reranker to ensure only the most relevant context is passed to a Large Language Model in production environments.
Claude-Mem is a persistent memory compression system designed specifically for Claude Code and Gemini CLI. It automatically captures tool usage observations, generates semantic summaries via AI, and injects relevant context into future sessions to ensure continuity of knowledge across coding projects.
Key features include:
* Persistent memory that survives session restarts
* Progressive disclosure architecture for token-efficient retrieval
* Skill-based search using MCP tools (search, timeline, get_observations)
* Hybrid semantic and keyword search powered by Chroma vector database and SQLite
* Privacy controls via specific tags to exclude sensitive data
* A web viewer UI for real-time memory stream monitoring
Key features include:
* Persistent memory that survives session restarts
* Progressive disclosure architecture for token-efficient retrieval
* Skill-based search using MCP tools (search, timeline, get_observations)
* Hybrid semantic and keyword search powered by Chroma vector database and SQLite
* Privacy controls via specific tags to exclude sensitive data
* A web viewer UI for real-time memory stream monitoring
RAG combines language models with external knowledge. This article explores context & retrieval in RAG, covering search methods (keywords, TF-IDF, embeddings/FAISS/Chroma), context length challenges (compression, re-ranking), and contextual retrieval (query & conversation history).
Learn how to build a simple semantic search engine using sentence embeddings and nearest neighbors, focusing on the limitations of keyword-based search and leveraging large language models for semantic understanding.
This article explains the internal workings of vector databases, highlighting that they don't perform a brute-force search as commonly described. It details algorithms like HNSW, IVF, and PQ, the tradeoffs between recall, speed, and memory, and how different RAG patterns impact vector database usage. It also discusses production challenges like filtering, updates, and sharding.
The article explores whether combining a command-line agent (like Claude Code or Gemini CLI) with Unix-like file system tools and SemTools is sufficient for complex tasks, particularly document search. It details a benchmark testing the limits of coding agents with and without SemTools, focusing on search, cross-referencing, and temporal analysis. The conclusion is that CLI access is powerful and SemTools enhances agent capabilities for document search and RAG.
Ryan speaks with Edo Liberty, Founder and CEO of Pinecone, about building vector databases, the power of embeddings, the evolution of RAG, and fine-tuning AI models.
This article details how to automate embedding generation and updates in Postgres using Supabase Vector, Queues, Cron, and pg_net extension with Edge Functions, addressing the issues of drift, latency, and complexity found in traditional external embedding pipelines.
Foundational concepts, practical implementation of semantic search, and the workflow of RAG, highlighting its advantages and versatile applications.
The article provides a step-by-step guide to implementing a basic semantic search using TF-IDF and cosine similarity. This includes preprocessing steps, converting text to embeddings, and searching for relevant documents based on query similarity.
The article provides a step-by-step guide to implementing a basic semantic search using TF-IDF and cosine similarity. This includes preprocessing steps, converting text to embeddings, and searching for relevant documents based on query similarity.
