Tag: AI engineering

Retrieval-Augmented Generation (RAG) is one of the most impactful patterns in modern AI engineering. It solves a core limitation of large language models: their knowledge is frozen at training time. RAG gives your LLM a live connection to your organization’s data, letting it answer questions about current events, internal documents, product specs, customer records, and anything else that changes over time.

But RAG is deceptively simple to prototype and surprisingly hard to run well in production. This guide walks through every layer of a production RAG system — from chunking strategy and embedding models to retrieval tuning, re-ranking, caching, and observability — so you can build something that actually works at scale.

What Is RAG and Why Does It Matter?

The core idea behind RAG is straightforward: instead of relying solely on an LLM’s parametric memory (what it learned during training), you retrieve relevant context from an external knowledge store at inference time and include that context in the prompt. The model then generates a response grounded in both its training and the retrieved documents.

This matters for several reasons. LLMs hallucinate. When they don’t know something, they sometimes confidently fabricate an answer. Providing retrieved context gives the model something real to anchor to. It also makes answers auditable — you can show users the source passages the model drew from. And it keeps your system up to date without the cost and delay of retraining.

For enterprise teams, RAG is typically the right first move before considering fine-tuning. Fine-tuning changes the model’s behavior and style; RAG changes what it knows. Most business use cases — internal knowledge bases, support chatbots, document Q&A, compliance assistants — are knowledge problems, not behavior problems.

The RAG Pipeline: An End-to-End Overview

A production RAG pipeline has two distinct phases: indexing and retrieval. Getting both right is essential.

During indexing, you ingest your source documents, split them into chunks, convert each chunk into a vector embedding, and store those embeddings in a vector database alongside the original text. This phase runs offline (or on a schedule) and is your foundation — garbage in, garbage out.

During retrieval, a user query comes in, you embed it using the same embedding model, search the vector store for the most semantically similar chunks, optionally re-rank the results, and inject the top passages into the LLM prompt. The model generates a response from there.

Simple to describe, but each step has production-critical decisions hiding inside it.

Chunking Strategy: The Step Most Teams Get Wrong

Chunking is how you split source documents into pieces small enough to embed meaningfully. It is also the step most teams under-invest in, and it has an outsized effect on retrieval quality.

Fixed-size chunking — splitting every 500 tokens with a 50-token overlap — is the default in most tutorials and frameworks. It works well enough to demo and poorly enough to frustrate you in production. The problem is that documents are not uniform. A 500-token window might capture one complete section in one document and span three unrelated sections in another.

Better approaches depend on your content type. For structured documents like PDFs with clear headings, use semantic or hierarchical chunking that respects section boundaries. For code, chunk at the function or class level. For conversational transcripts, chunk by speaker turn or topic segment. For web pages, strip boilerplate and chunk by semantic paragraph clusters.

Overlap matters more than most people realize. Without overlap, a key sentence that falls exactly at a chunk boundary disappears from both sides. Too much overlap inflates your index and slows retrieval. A 10-20% overlap by token count is a reasonable starting point; tune it based on your document structure.

One pattern worth adopting early: store both a small chunk (for precise retrieval) and a reference to its parent section (for context injection). Retrieve on the small chunk, but inject the larger parent into the prompt. This is sometimes called “small-to-big” retrieval and dramatically improves answer coherence for complex questions.

Choosing and Managing Your Embedding Model

The embedding model converts text into a high-dimensional vector that captures semantic meaning. Two chunks about the same concept should produce vectors that are close together in that space; two chunks about unrelated topics should be far apart.

Model choice matters enormously. OpenAI’s text-embedding-3-large and Cohere’s embed-v3 are strong hosted options. For teams that need on-premises deployment or lower latency, BGE-M3 and E5-mistral-7b-instruct are competitive open-source alternatives. If your corpus is domain-specific — legal, medical, financial — consider fine-tuning an embedding model on in-domain data.

One critical operational constraint: you must re-index your entire corpus if you switch embedding models. Embeddings from different models are not comparable. This makes embedding model selection a long-term architectural decision, not just an experiment setting. Evaluate on a representative sample of your real queries before committing.

Also account for embedding dimensionality. Higher dimensions generally mean better semantic precision but more storage and slower similarity search. Many production systems use Matryoshka Representation Learning (MRL) models, which let you truncate embeddings to a shorter dimension at query time with minimal quality loss — a useful efficiency lever.

Vector Databases: Picking the Right Store

Your vector database stores embeddings and serves approximate nearest-neighbor (ANN) queries at low latency. Several solid options exist in 2026, each with different tradeoffs.

Pinecone is fully managed, easy to get started with, and handles scaling transparently. Its serverless tier is cost-efficient for smaller workloads; its pod-based tier gives you more control over throughput and memory. It integrates cleanly with most RAG frameworks.

Qdrant is an open-source option with strong filtering capabilities, a Rust-based core for performance, and flexible deployment (self-hosted or cloud). Its payload filtering — the ability to apply structured metadata filters alongside vector similarity — is one of the best in the field.

pgvector is the pragmatic choice for teams already running PostgreSQL. Adding vector search to an existing Postgres instance avoids operational overhead, and for many workloads — especially where vector search combines with relational joins — it performs well enough. It does not scale to billions of vectors, but most enterprise knowledge bases never reach that scale.

Azure AI Search deserves mention for Azure-native stacks. It combines vector search with keyword search (BM25) and hybrid retrieval natively, offers built-in chunking and embedding pipelines via indexers, and integrates with Azure OpenAI out of the box. If your data is already in Azure Blob Storage or SharePoint, this is often the path of least resistance.

Hybrid Retrieval: Why Vector Search Alone Is Not Enough

Pure vector search is good at semantic similarity — finding conceptually related content even when it uses different words. But it is weak at exact-match retrieval: product SKUs, contract clause numbers, specific version strings, or names that the embedding model has never seen.

Hybrid retrieval combines dense (vector) search with sparse (keyword) search, typically BM25, and merges the result sets using Reciprocal Rank Fusion (RRF) or a learned merge function. In practice, hybrid retrieval consistently outperforms either approach alone on real-world enterprise queries.

Most production teams settle on a hybrid approach as their default. Start with equal weight between dense and sparse, then tune the balance based on your query distribution. If your users ask a lot of exact-match questions (lookup by ID, product name, etc.), lean sparse. If they ask conceptual or paraphrased questions, lean dense.

Re-Ranking: The Quality Multiplier

Vector similarity is an approximation. A chunk that scores high on cosine similarity is not always the most relevant result for a given query. Re-ranking adds a second stage: take the top-N retrieved candidates and run them through a cross-encoder model that scores each candidate against the full query, then re-sort by that score.

Cross-encoders are more computationally expensive than bi-encoders (which produce the embeddings), but they are also significantly more accurate at ranking. Because you only run them on the top 20-50 candidates rather than the full corpus, the cost is manageable.

Cohere Rerank is the most widely used hosted re-ranker; it takes your query and a list of documents and returns relevance scores in a single API call. Open-source alternatives include ms-marco-MiniLM-L-12-v2 from HuggingFace and the BGE-reranker family. Both are fast enough to run locally and drop meaningfully fewer relevant passages than vector-only retrieval.

Adding re-ranking to a RAG pipeline that already uses hybrid retrieval is typically the highest-ROI improvement you can make after the initial system is working. It directly reduces the rate at which relevant context gets left out of the prompt — which is the main cause of factual misses.

Query Understanding and Transformation

User queries are often underspecified. A question like “what are the limits?” means nothing without context. Several query transformation techniques improve retrieval quality before you even touch the vector store.

HyDE (Hypothetical Document Embeddings) asks the LLM to generate a hypothetical answer to the query, then embeds that answer rather than the raw query. The hypothesis is often closer in semantic space to the relevant chunks than the terse question. HyDE tends to help most when queries are short and abstract.

Query rewriting uses an LLM to expand or rephrase the user’s question into a clearer, more retrieval-friendly form before embedding. This is especially useful for conversational systems where the user’s question references earlier turns (“what about the second option you mentioned?”).

Multi-query retrieval generates multiple paraphrases of the original query, retrieves against each, and merges the result sets. It reduces the fragility of depending on a single embedding and improves recall at the cost of extra latency and API calls. Use it when recall is more important than speed.

Context Assembly and Prompt Engineering

Once you have your retrieved and re-ranked chunks, you need to assemble them into a prompt. This step is less glamorous than retrieval tuning but equally important for output quality.

Chunk order matters. LLMs tend to pay more attention to content at the beginning and end of the context window than to content in the middle — the “lost-in-the-middle” effect documented in multiple research papers. Put your most relevant chunks at the start and end, not buried in the center.

Be explicit about grounding instructions. Tell the model to base its answer on the provided context, to acknowledge uncertainty when the context is insufficient, and not to speculate beyond what the documents support. This dramatically reduces hallucinations in production.

Track token budgets carefully. If you inject too many chunks, you may overflow the context window or crowd out important instructions. A practical rule: reserve at least 20-30% of the context window for the system prompt, conversation history, and the user query. Allocate the rest to retrieved context, and clip gracefully rather than truncating silently.

Caching: Cutting Costs Without Sacrificing Quality

RAG pipelines are expensive. Every request involves at least one embedding call, one or more vector searches, optionally a re-ranking call, and then an LLM generation. In high-volume systems, costs compound quickly.

Semantic caching addresses this by caching LLM responses keyed by the embedding of the query rather than the exact query string. If a new query is semantically close enough to a cached query (above a configurable similarity threshold), you return the cached response rather than hitting the LLM. Tools like GPTCache, LangChain’s caching layer, and Redis with vector similarity support enable this pattern.

Embedding caching is simpler and often overlooked: if you are running re-ranking or multi-query expansion and embedding the same text multiple times, cache the embedding results. This is a free win.

For systems with a small, well-defined question set — FAQ bots, support assistants, policy lookup tools — a traditional exact-match cache on normalized query strings is worth considering alongside semantic caching. It is faster and eliminates any risk of returning a semantically close but slightly wrong cached answer.

Observability and Evaluation

You cannot improve what you cannot measure. Production RAG systems need dedicated observability pipelines, not just generic application monitoring.

At minimum, log: the original query, the transformed query (if using HyDE or rewriting), the retrieved chunk IDs and scores, the re-ranked order, the final assembled prompt, the model’s response, and end-to-end latency broken down by stage. This data is your diagnostic foundation.

For automated evaluation, the RAGAS framework is the current standard. It computes faithfulness (does the answer reflect the retrieved context?), answer relevancy (does the answer address the question?), context precision (are the retrieved chunks relevant?), and context recall (did retrieval find all the relevant chunks?). Run RAGAS against a curated golden dataset of question-answer pairs on every pipeline change.

Human evaluation is still irreplaceable for nuanced quality assessment, but it does not scale. A practical approach: use automated evaluation as a gate on every code change, and reserve human review for periodic deep-dives and for investigating regressions flagged by your automated metrics.

Security and Access Control

RAG introduces a class of security considerations that pure LLM deployments do not have: you are now retrieving and injecting documents from your data stores into prompts, which creates both access control obligations and injection attack surfaces.

Document-level access control is non-negotiable in enterprise deployments. The retrieval layer must enforce the same permissions as the underlying document system. If a user cannot see a document in SharePoint, they should not get answers derived from that document via RAG. Implement this by storing user and group permissions as metadata on each chunk and applying them as filters in every retrieval query.

Prompt injection via retrieved documents is a real attack vector. If adversarial content can be inserted into your indexed corpus — through user-submitted documents, web scraping, or untrusted third-party data — that content could attempt to hijack the model’s behavior via injected instructions. Sanitize and validate content at ingest time, and apply output validation at generation time to catch obvious injection attempts.

Common Failure Modes and How to Fix Them

After building and operating RAG systems, certain failure patterns repeat across different teams and use cases. Knowing them in advance saves significant debugging time.

Retrieval misses the relevant chunk entirely. The answer is in your corpus, but the model says it doesn’t know. This is usually a chunking problem (the relevant content spans a chunk boundary), an embedding mismatch (the query and document use different terminology), or a metadata filtering bug that excludes the right document. Fix by inspecting chunk boundaries, trying hybrid retrieval, and auditing your filter logic.

The model ignores the retrieved context. Relevant chunks are in the prompt, but the model still generates a wrong or hallucinated answer. This often means the chunks are poorly ranked (the truly relevant one is buried in the middle) or the system prompt does not strongly enough ground the model to the retrieved content. Re-rank more aggressively and reinforce grounding instructions.

Answers are vague or over-hedged. The model constantly says “based on the available information, it appears that…” when the documents contain a clear answer. This usually means retrieved chunks are too short or too fragmented to give the model enough context. Revisit chunk size and consider small-to-big retrieval.

Latency is unacceptable. RAG pipelines add multiple serial API calls. Profile each stage. Embedding is usually fast; re-ranking is often the bottleneck. Consider parallel retrieval (run vector and keyword search simultaneously), async re-ranking with early termination, and semantic caching to reduce LLM calls.

Conclusion: RAG Is an Engineering Problem, Not Just a Prompt Problem

RAG works remarkably well when built thoughtfully, and it falls apart when treated as a plug-and-play wrapper around a vector search library. The difference between a demo and a production system is the care taken in chunking strategy, embedding model selection, hybrid retrieval, re-ranking, context assembly, caching, observability, and security.

None of these layers are exotic. They are well-understood engineering disciplines applied to a new domain. Teams that invest in getting them right end up with AI assistants that users actually trust — and that trust is the whole point.

Start with a working baseline: good chunking, a strong embedding model, hybrid retrieval, and grounded prompts. Measure everything from day one. Add re-ranking, caching, and query transformation as your data shows they matter. And treat RAG as a system you operate, not a configuration you set once and forget.