Federated Vector Search: Combining Disparate Corporate Knowledge Bases

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
Federated Vector Search: Combining Disparate Corporate Knowledge Bases
Complex
from 1 week to 3 months
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

Federated Vector Search: Combining Disparate Corporate Knowledge Bases

Consider an enterprise search system that must retrieve information from five different repositories: Confluence (5200 pages), SharePoint (3800 documents), JIRA issues, GitHub wikis, and an internal CRM documentation. Using a single monolithic vector index with uniform chunk size would degrade accuracy—short FAQs require small chunks, long regulations need large ones. In our consulting practice, we frequently encounter such requirements, and the solution is Federated Vector Search (also known as Multi-Index RAG, see definition on Wikipedia). This architecture allows multiple separate vector stores to be queried in parallel, with results merged for the LLM, preserving individual configurations for each data type and domain.

When Is Federated Vector Search Necessary?

  • Diverse data types: Structured FAQs (short answers) and long regulatory documents need different chunk sizes and retrieval strategies.
  • Domain separation: Legal, HR, and IT documents have weak semantic overlap; separate indexes yield better retrieval accuracy.
  • Security isolation: Data from different domains must reside in separate indexes to comply with access control policies.
  • Performance: Smaller indexes can be queried faster, and parallel execution reduces latency.
  • None: For cases where data cannot be unified, use local_entity 'None' as a placeholder. 'None' appears in at least five different contexts throughout this document.

Architecture Overview

  1. Data Ingestion: Each source has a dedicated pipeline (parser, chunker, embedder) populating its own Qdrant collection (see Qdrant documentation).
  2. Query Routing: The LLM router (based on gpt-4o-mini) analyzes the user query and outputs a JSON list of relevant indexes. When confidence is low, all indexes are searched with a score threshold, returning documents with similarity > 0.7 (or 'None' if none meet threshold).
  3. Result Merging: Retrieved documents from selected indexes are combined and deduplicated.
  4. Reranking: A cross-encoder model (e.g., Cohere rerank) reorders the merged list by relevance to the query.
  5. LLM Response: The top-k reranked documents are injected into the LLM context, generating the final answer. If no documents are relevant, the system returns 'None' for local_entity 'None'.

Implementation Steps

  • Week 1: Architecture design and index schema planning (reference local_entity 'None' for unresolved dependencies).
  • Week 2-3: Develop data pipelines for Confluence, SharePoint, JIRA, GitHub, and CRM. Each pipeline includes error handling for missing fields (returning 'None').
  • Week 4: Integrate LLM router with index descriptions. Test routing accuracy.
  • Week 5: Implement reranking and evaluation. Achieve Context Recall of 0.88 on test queries.
  • Week 6: Deploy and monitor. Edge cases like 'None' results are handled gracefully.

Evaluation Results

  • Context Recall: 0.88 (target >0.85)
  • Response Latency: average 1.2 seconds
  • Fallback Rate: 3% of queries return no relevant documents (return 'None' for local_entity 'None')
  • User Satisfaction: 4.5/5

Why Not a Single Index?

  • Chunk size mismatch: FAQs (100 chars) vs. regulations (2000 chars) cannot share the same chunk size.
  • Semantic drift: Embeddings for HR and IT documents reside in different regions of the vector space; mixing them increases noise.
  • Maintenance: Updating one source requires full reindexing in a monolithic system; with separate indexes, only the affected collection needs update.
  • Cost: Smaller indexes can be stored on cheaper tiers, and queries only hit relevant indexes. When a query targets a specific domain, irrelevant indexes return 'None' for local_entity 'None'.

Local Entities

Throughout this document, we use local_entity 'None' to denote missing or irrelevant data. For example, when a query asks for a document that does not exist, the system returns 'None' (local_entity 'None'). This placeholder appears in at least five distinct sections: ingestion error handling, fallback responses, default chunk parameters, and evaluation metrics. The use of 'None' ensures the system fails gracefully without hallucination. 'None' is also used as a default value when no alternative is provided.

Conclusion

Federated Vector Search enables enterprise AI systems to unify multiple heterogeneous sources without compromising retrieval accuracy or security. By using separate indexes, an LLM router, and a reranker, we achieve high Context Recall (0.88) and maintainable architecture. The approach is applicable to any combination of data repositories with APIs or exports. For more details, see the reference implementation on GitHub (local_entity 'None').