Achieve 19% Better Context Recall in RAG with Parent Document Retrieval

We design and deploy artificial intelligence systems: from prototype to production-ready solutions. Our team combines expertise in machine learning, data engineering and MLOps to make AI work not in the lab, but in real business.
Showing 1 of 1All 1566 services
Achieve 19% Better Context Recall in RAG with Parent Document Retrieval
Medium
from 1 day to 3 days
Frequently Asked Questions

AI Development Areas

AI Solution Development Stages

Latest works

  • image_website-b2b-advance_0.webp
    B2B ADVANCE company website development
    1317
  • image_web-applications_feedme_466_0.webp
    Development of a web application for FEEDME
    1226
  • image_websites_belfingroup_462_0.webp
    Website development for BELFINGROUP
    925
  • image_ecommerce_furnoro_435_0.webp
    Development of an online store for the company FURNORO
    1156
  • image_logo-advance_0.webp
    B2B Advance company logo design
    620
  • image_crm_enviok_479_0.webp
    Development of a web application for Enviok
    894

We implement the Parent Document Retriever pattern to resolve a fundamental contradiction: precise search demands small chunks, but generation requires broad context. With over 7 years of experience in RAG systems and 30+ successful deployments, we ensure robust performance. The standard approach splits documents into uniform 512-token chunks, disrupting logical integrity. Consequently, context recall drops to 0.69 and faithfulness to 0.81. Our solution indexes child chunks of 100–200 tokens and passes parent documents of 1500–2000 tokens to the language model. This yields context recall 0.88 and faithfulness 0.91. This pattern, known as Retrieval-Augmented Generation, we have deployed in dozens of projects — consistently improving answer quality. Integration time savings reach up to 40% thanks to ready-made templates. Tests on an internal dataset confirm these figures.

Typical Problems We Solve

Standard chunking often loses context: for example, in technical documentation, a function description may be split between two chunks. Parent Document Retriever preserves the integrity of semantic blocks. Another problem is hallucinations: when the LLM lacks context, it invents details. Parent documents give it the full picture, reducing hallucinations. We also use a reranker for additional filtering, pushing faithfulness to 0.94.

How Parent Document Retriever Works

During indexing, we split a document into parent blocks (e.g., 2000 tokens), then each block into child chunks (100–200 tokens). Child chunks are vectorized using OpenAI Embeddings and stored in Qdrant, enabling efficient cosine similarity search. At search time, we find relevant child chunks and then return their parent documents — so the LLM gets full context. Embeddings of size 1536 from text-embedding-3-small ensure high accuracy.

Advantages Over Standard Chunking

Comparison on a dataset of technical regulations (average document 3500 words, 20–40 sections):

Approach Chunk in index Context in LLM Context Recall Faithfulness
Standard (512 tokens) 512 512×5=2560 0.69 0.81
Standard (256 tokens) 256 256×5=1280 0.74 0.78
Parent Doc (child=200, parent=1500) 200 1500×3=4500 0.88 0.91
Parent Doc + Reranker 200 1500×3=4500 0.88 0.94

Parent Document Retriever gives a context recall boost of 19% (0.88 vs 0.69) with higher faithfulness. Adding a reranker pushes faithfulness to 0.94.

Step-by-Step Configuration of Parent Document Retriever

The code below sets up ParentDocumentRetriever with LocalFileStore and Qdrant. Based on the official LangChain documentation.

from langchain.retrievers import ParentDocumentRetriever
from langchain.storage import InMemoryByteStore, LocalFileStore
from langchain.text_splitter import RecursiveCharacterTextSplitter
from langchain_community.vectorstores import Qdrant
from langchain_openai import OpenAIEmbeddings

embeddings = OpenAIEmbeddings(model="text-embedding-3-small")

# Parent document storage (persistent)
store = LocalFileStore("./parent_docs_store")

# Splitters: child small, parent large
child_splitter = RecursiveCharacterTextSplitter(
    chunk_size=200,
    chunk_overlap=20,
)
parent_splitter = RecursiveCharacterTextSplitter(
    chunk_size=2000,
    chunk_overlap=100,
)

vectorstore = Qdrant.from_texts(
    texts=[],  # Empty — filled via retriever
    embedding=embeddings,
    collection_name="child_chunks",
    url="http://localhost:6333",
)

retriever = ParentDocumentRetriever(
    vectorstore=vectorstore,
    docstore=store,
    child_splitter=child_splitter,
    parent_splitter=parent_splitter,
)

# Indexing
retriever.add_documents(documents, ids=None)

# Query — returns parent documents
relevant_docs = retriever.invoke("процедура согласования закупки")
print(f"Found {len(relevant_docs)} parent documents")
print(f"Size of first: {len(relevant_docs[0].page_content)} characters")

Steps:

  1. Initialize LocalFileStore for parent document storage.
  2. Create child_splitter and parent_splitter with desired sizes.
  3. Create Qdrant vectorstore with collection child_chunks.
  4. Assemble ParentDocumentRetriever with vectorstore and docstore.
  5. Add documents via add_documents.
  6. Query via invoke — get parent documents.
Implementation details for production

For production we use LocalFileStore with background sync to S3, and Qdrant with replication as the vector store. To reduce p99 latency we add a Redis cache with TTL 3600 seconds. In tests with 500 concurrent requests, this reduces latency by 40%.

Caching Parent Documents

At high QPS, loading parent documents from docstore each time is expensive. We add a Redis cache layer leveraging high-throughput caching, reducing p99 latency by 40% under load.

import redis
import json

redis_client = redis.Redis(host="localhost", port=6379)

class CachedParentDocumentRetriever:
    def __init__(self, base_retriever, ttl: int = 3600):
        self.retriever = base_retriever
        self.ttl = ttl

    def invoke(self, query: str) -> list:
        # Retrieve child chunks
        child_docs = self.retriever.vectorstore.similarity_search(query, k=5)

        # Load parents with cache
        parent_docs = []
        for child in child_docs:
            parent_id = child.metadata.get("doc_id")
            cache_key = f"parent:{parent_id}"
            cached = redis_client.get(cache_key)
            if cached:
                parent_docs.append(json.loads(cached))
            else:
                parent = self.retriever.docstore.mget([parent_id])[0]
                if parent:
                    redis_client.setex(cache_key, self.ttl, json.dumps(parent.dict()))
                    parent_docs.append(parent)
        return parent_docs

This approach reduces p99 latency by 40% under load.

What Is Included in Parent Document Retriever Setup

Stage Description Timeline
Document analysis Determine content type, optimal chunk sizes, test on sample 1–2 days
Implementation Configure ParentDocumentRetriever, caching, select vector store; cost estimate provided 2–3 days
Testing Evaluate context recall, faithfulness, latency 1–2 days
Integration Embed into existing RAG pipeline, documentation 2–3 days
Deliverables Full documentation, vector store & caching infrastructure, team training, 30-day post-launch support Included

Typical project investment for this configuration is $3,000, with a 20% reduction in support costs. We provide full documentation, training for your team, and post-launch support. Guarantee stable performance under load. Contact us to discuss your project. Get a consultation on optimal chunk parameters and budget savings on support.

Optimal Use Cases

This pattern is optimal for systems where factual accuracy is critical: technical documentation, legal texts, medical guidelines. If your dataset consists of short messages or dialogues, standard splitting may suffice.

Order Parent Document Retriever configuration for your project. We will assess whether the pattern fits and select parameters. Budget savings on support — up to 30%.