Skip to content
Make in India OEM · INR-transparent · Pan-India onsite SLATalk to sales: +91 720 794 8743Sign in

Local RAG on a Mid-Tier Workstation: Index Size and Honest Limits

Sizing guide Updated 28 Jul 2026 · 6 min read

Overview

Running a private retrieval system entirely on a workstation is one of the more practical uses of mid-tier hardware, and one of the more commonly over-promised. The appeal for Indian teams handling confidential or regulated material is straightforward: nothing leaves the machine, so a whole category of governance questions never arises. The constraint is that three things compete for the same VRAM — the generation model, the embedding model and the vector index — and understanding that split is what separates a system that works from one that thrashes.

Local RAG on a Mid-Tier Workstation: Index Size and Honest Limits
What you’ll learn: how VRAM divides between the components of a local RAG stack, how many documents a mid-tier workstation realistically supports, what belongs in system RAM rather than VRAM, where quality limits bite, and when to move to a server.

Key takeaways

  • Three consumers compete — generation model, embedding model and index, plus KV cache for retrieved context.
  • The index does not need VRAM — for most corpus sizes it belongs in system RAM or on NVMe.
  • A few hundred thousand documents is realistic on a 96 GB mid-tier machine with quantization.
  • Retrieved context inflates KV cache — RAG prompts are long, which is the usual memory surprise.
  • Re-ranking is the cheapest quality win, and it fits comfortably alongside everything else.

Where the memory goes

Start by separating the four consumers. The generation model dominates: a 32-billion-parameter model at 4-bit occupies roughly 18 GB. The embedding model is small — typically under 2 GB — and only needs to be resident during indexing and query embedding. KV cache holds the prompt, and RAG prompts are long because they carry retrieved passages, so this is larger than for plain chat. The vector index is the fourth, and it is the one people misplace.

Vector search does not require GPU residency at the scales a workstation handles. A quantized index over a few hundred thousand documents fits comfortably in system RAM and searches fast enough on CPU that the GPU is better used for generation. Putting the index in VRAM on a workstation is usually a mistake: it competes with the model for the scarcest resource in exchange for latency improvement the user cannot perceive.

What a workstation realistically holds

Corpus size Approx. chunks Index memory (quantized) Workstation fit
10,000 documents ~200,000 Low single-digit GB Comfortable, system RAM
100,000 documents ~2 million Tens of GB Fine with scalar quantization
500,000 documents ~10 million Approaching 100 GB Needs product quantization or disk index
2 million documents ~40 million Beyond workstation RAM Disk-based index or server

These figures assume moderate embedding dimensions and scalar quantization; the full arithmetic including graph overhead is in vector index sizing. The practical reading is that a well-specified mid-tier workstation with 128 GB of system RAM handles a corpus of a few hundred thousand documents — which covers most departmental knowledge bases, personal research libraries and single-project document sets.

The KV cache surprise

The most common memory failure in a local RAG deployment is not the index. It is that RAG prompts are long. A query that retrieves eight passages of 800 tokens each carries over 6,000 tokens of context before the user’s question, and if the system supports conversation history the prompt grows further with each turn.

Two consequences. Concurrency falls sharply: a workstation that would serve six chat sessions might serve two RAG sessions with the same model. And the temptation to retrieve more passages for better coverage has a direct memory cost. The disciplined response is to retrieve broadly but re-rank aggressively, passing only the best three to five passages to the generator — which improves quality and reduces memory simultaneously.

Re-ranking is the best value component

A cross-encoder re-ranker takes the top candidates from vector search and scores each against the query directly, which is far more accurate than embedding similarity. Re-rankers are small, often a few hundred million parameters, so they add little memory pressure, and they consistently produce the largest quality improvement per gigabyte of any component in the stack.

The pattern is: retrieve 30 to 50 candidates cheaply by vector similarity, re-rank them, pass the top few to the generator. On a workstation this is close to free and it addresses the main weakness of pure vector retrieval, which is that semantic similarity and actual relevance diverge more than people expect on technical corpora.

Honest limits

Three things a workstation RAG system does not do well. Concurrency: it serves one user comfortably, two at a stretch, and degrades badly beyond that because every session multiplies KV cache. Ingestion at scale: embedding a large document set is a batch job measured in hours, and re-embedding after a model change repeats it. Availability: it is a single machine, so any expectation of it being reliably available to others is misplaced.

It also cannot substitute for a properly engineered enterprise deployment where document permissions matter. A local system typically indexes everything the user can already see, which is correct for a personal system and unacceptable for a shared one where per-user access control must be enforced at retrieval time. That is a server-side concern, covered in right-sizing a GPU server for enterprise RAG.

When it is exactly the right tool

Three cases justify it clearly. Confidential single-user work — a lawyer, a researcher, an engineer working with material that must not leave the machine, which under DPDP is the simplest possible governance position. Development of a RAG system that will later run on a server, where building against a local stack gives fast iteration and the architecture transfers. And field or disconnected use, where no network is available.

For any of these, a mid-tier workstation with substantial system RAM, a 32 GB or larger GPU and fast NVMe is a genuinely capable platform. The tier’s broader capabilities are described in the 96 GB desk-side tier, and the routing question of when retrieval beats long context in long context vs RAG in 2026.

Frequently asked questions

Does the vector index need to be in GPU memory?

At workstation scale, no. A quantized index over a few hundred thousand documents fits in system RAM and searches fast enough on CPU. Putting it in VRAM competes with the generation model for the scarcest resource with imperceptible latency benefit.

How many documents can a mid-tier workstation handle?

With 128 GB of system RAM and scalar quantization, a few hundred thousand documents is realistic — enough for most departmental knowledge bases and single-project sets. Beyond roughly 500,000 documents, product quantization or a disk-based index becomes necessary.

Why does local RAG use more memory than local chat?

Because RAG prompts carry retrieved passages. Eight passages of 800 tokens is over 6,000 tokens of context before the question, which inflates KV cache and sharply reduces how many concurrent sessions the machine supports.

What improves quality most on limited hardware?

A cross-encoder re-ranker. It is small, adds little memory pressure, and consistently delivers the largest quality gain per gigabyte by scoring candidates against the query directly rather than relying on embedding similarity alone.

When should local RAG move to a server?

When more than one or two concurrent users need it, when per-user document permissions must be enforced at retrieval time, or when availability matters. A local system indexes what its single user can already see, which is unacceptable for shared deployments.

Ready to deploy?

Talk to an RDP architect about power, cooling and lead time.

Request a Quote