Building a High-Performance Entity Matching Solution with Qdrant - Rishabh Bhardwaj | Vector Space Talks - Qdrant
Jan 9, 2024Demetrios Brinkmann

Summary
This post details the use of Qdrant for high-performance entity matching, specifically for hotel data. It highlights the challenges of data inconsistency, duplication, and real-time processing across multiple languages. The solution leverages Qdrant's HNSW algorithm for efficient vector indexing, demonstrating significant improvements in speed and recall compared to initial PostgreSQL experiments with Pgvector. The post also touches upon the importance of geofiltering for accurate matching and the experimentation with different embedding models (Mini LM) and HNSW parameters (M and efConstruct) to optimize performance.
More from the Filtered Vector Search trail
- How Lucy Built a Source-of-Truth Retrieval Layer for 2.8M+ SEC and DART Filings with Qdrant - Qdrant
- How Himalayas Built Semantic Job Matching for 100,000+ Remote Listings with Qdrant - Qdrant
- How to Tune Vector Search Without Guessing - Qdrant
- Pre-Filtering vs Post-Filtering (and Why Qdrant Does Neither) - Qdrant
- Filtered Vector Search: What ACORN Fixes, and What Fixes ACORN - Qdrant