<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Search Patterns on Qdrant - Vector Search Engine</title><link>https://qdrant.tech/documentation/search-patterns/</link><description>Recent content in Search Patterns on Qdrant - Vector Search Engine</description><generator>Hugo</generator><language>en-us</language><managingEditor>info@qdrant.tech (Andrey Vasnetsov)</managingEditor><webMaster>info@qdrant.tech (Andrey Vasnetsov)</webMaster><atom:link href="https://qdrant.tech/documentation/search-patterns/index.xml" rel="self" type="application/rss+xml"/><item><title>How to Choose an Embedding Model: Evaluation &amp; Tradeoffs</title><link>https://qdrant.tech/documentation/search-patterns/choose-embedding-model/</link><pubDate>Tue, 15 Jul 2025 00:00:00 +0000</pubDate><author>info@qdrant.tech (Andrey Vasnetsov)</author><guid>https://qdrant.tech/documentation/search-patterns/choose-embedding-model/</guid><description>&lt;h1 id="how-to-choose-an-embedding-model-evaluation--tradeoffs"&gt;How to Choose an Embedding Model: Evaluation &amp;amp; Tradeoffs&lt;/h1&gt;
&lt;p&gt;No matter if you are just beginning your journey in the world of vector search, or you are a seasoned practitioner, you
have probably wondered how to choose the right embedding model to achieve the best search quality. There are some
public benchmarks, such as &lt;a href="https://huggingface.co/spaces/mteb/leaderboard" target="_blank" rel="noopener nofollow"&gt;MTEB&lt;/a&gt;, that can help you narrow down the
options, but datasets used in those benchmarks will rarely be representative of your domain-specific data. Moreover,
search quality is not the only requirement you could have. For example, some of the best models might be amazingly
accurate for retrieval, but you can&amp;rsquo;t afford to run them, e.g., due to high resource usage or your budget constraints.&lt;/p&gt;</description></item><item><title>Query Decomposition for Multi-Hop Questions</title><link>https://qdrant.tech/documentation/search-patterns/query-decomposition/</link><pubDate>Mon, 01 Jan 0001 00:00:00 +0000</pubDate><author>info@qdrant.tech (Andrey Vasnetsov)</author><guid>https://qdrant.tech/documentation/search-patterns/query-decomposition/</guid><description>&lt;h1 id="query-decomposition-for-multi-hop-questions"&gt;Query Decomposition for Multi-Hop Questions&lt;/h1&gt;
&lt;table&gt;
 &lt;thead&gt;
 &lt;tr&gt;
 &lt;th&gt;Time: 15 min&lt;/th&gt;
 &lt;th&gt;Level: Intermediate&lt;/th&gt;
 &lt;th&gt;&lt;/th&gt;
 &lt;th&gt;&lt;/th&gt;
 &lt;/tr&gt;
 &lt;/thead&gt;
 &lt;tbody&gt;
 &lt;/tbody&gt;
&lt;/table&gt;
&lt;p&gt;A multi-hop question chains two facts: the second depends on the answer to the first. &amp;ldquo;Where was the director of the film Inception born?&amp;rdquo; needs the director, then that person&amp;rsquo;s birthplace. A single query retrieves chunks about the film, but the birthplace sits in a chunk about Christopher Nolan that never mentions Inception. Reranking and fusion only reorder what one query already retrieved, so they can&amp;rsquo;t recover evidence that was never in the candidate set.&lt;/p&gt;</description></item><item><title>A Complete Guide to Filtering in Vector Search</title><link>https://qdrant.tech/documentation/search-patterns/vector-search-filtering/</link><pubDate>Tue, 10 Sep 2024 00:00:00 +0000</pubDate><author>info@qdrant.tech (Andrey Vasnetsov)</author><guid>https://qdrant.tech/documentation/search-patterns/vector-search-filtering/</guid><description>&lt;h1 id="a-complete-guide-to-filtering-in-vector-search"&gt;A Complete Guide to Filtering in Vector Search&lt;/h1&gt;
&lt;p&gt;Imagine you sell computer hardware. To help shoppers easily find products on your website, you need to have a &lt;strong&gt;user-friendly &lt;a href="https://qdrant.tech" target="_blank" rel="noopener nofollow"&gt;search engine&lt;/a&gt;&lt;/strong&gt;.&lt;/p&gt;
&lt;p&gt;&lt;img src="https://qdrant.tech/articles_data/vector-search-filtering/vector-search-ecommerce.png" alt="vector-search-ecommerce"&gt;&lt;/p&gt;
&lt;p&gt;If you’re selling computers and have extensive data on laptops, desktops, and accessories, your search feature should guide customers to the exact device they want - or at least a &lt;strong&gt;very similar&lt;/strong&gt; match.&lt;/p&gt;
&lt;p&gt;When storing data in Qdrant, each product is a point, consisting of an &lt;code&gt;id&lt;/code&gt;, a &lt;code&gt;vector&lt;/code&gt; and &lt;code&gt;payload&lt;/code&gt;:&lt;/p&gt;</description></item></channel></rss>