Questions
5 of 18
1Why did Qdrant consolidate search, recommend, and discovery operations into the Universal Query API?
2What is a prefetch stage in Qdrant's Universal Query API, and why would you use multiple prefetches?
3How do Reciprocal Rank Fusion and Distribution-Based Score Fusion differ when combining Qdrant prefetch results?
4How would you retrieve 500 candidates with dense vectors and rerank them using a ColBERT multivector?
5What is Qdrant's recommend query mode, and how is it different from plain similarity search?
6How does Qdrant combine vector similarity search with structured payload filters?
7What are must, should, and must_not clauses in a Qdrant payload filter?
8Why can filtering after an ANN search return too few results when the filter is highly selective?
9How does Qdrant's filtered vector search avoid the classic post-filtering problem?
10How would you implement a geo-radius search for similar items within 5 km of a location in Qdrant?
11Why should you create payload indexes for fields that are filtered frequently at scale?
12What payload index types does Qdrant support, and how would you choose one for tags versus price?
13What is a full-text payload index used for, and how does it differ from an exact-match keyword index?
14What is the cost of creating too many payload indexes on a high-write Qdrant collection?
15Why should point uploads be batched instead of sending one upsert request per point?
16What is Qdrant's Scroll API used for, and why is it preferable to vector search when iterating through matching points?
17How does Qdrant Scroll pagination avoid the main performance problem of large SQL OFFSET pagination?
18What is a realistic batch size for bulk-loading millions of Qdrant points, and what factors should influence it?
05 / 18

What is Qdrant's recommend query mode, and how is it different from plain similarity search?

Recommendation queries

A recommend query is useful when the desired item is better described by examples than by a single explicit query vector. You provide positive examples and optionally negative examples, and Qdrant derives a recommendation direction from those points.

That differs from ordinary similarity search, where the query is a vector supplied by the caller and Qdrant ranks points by distance to that vector. Recommendation queries let the retrieval intent be expressed as 'find items like these, but unlike those' without the application necessarily constructing the embedding itself.

The trade-off is expressiveness versus predictability. A recommendation can be useful for personalization and 'more like this' behavior, while direct vector search is simpler when the application already has a well-defined query embedding.

A common misconception is that recommend is a completely separate similarity algorithm. It still relies on vector-space similarity; the distinction is how the query representation is constructed from positive and negative examples. Supported recommendation semantics can evolve with Qdrant releases.

javascript
  1. 1

    Recommendation queries use positive and optional negative examples

  2. 2

    Plain similarity search uses an explicit query vector

  3. 3

    Recommend is useful for 'more like these' and preference-driven retrieval

  4. 4

    Recommendation still operates in the configured vector space

Difficulty: 5/10
Topics: Recommend queries, Vector similarity

Scenario Questions

0-2 years experience
  1. 1

    A user likes three products and dislikes one. Which Qdrant query pattern could express 'find products like the liked ones but unlike the disliked one'?

  2. 2

    Why might recommend be more convenient than manually averaging several product embeddings?

2-5 years experience
  1. 1

    A recommendation system returns items that are similar to positive examples but still resemble a disliked category. How would you investigate the positive and negative example selection?

  2. 2

    A product team wants 'more like this item' and already has the item's vector. Would you use recommend or ordinary similarity search? Explain the choice.

5-8 years experience
  1. 1

    You need personalized recommendations based on several positive interactions and a small set of explicit dislikes. How would you design the query and evaluate whether the negative examples improve ranking?

  2. 2

    Recommendation quality varies significantly by user because some users have only one positive example. How would you handle sparse preference signals?

8+ years experience
  1. 1

    You are designing a recommendation platform where preference signals vary from explicit likes to implicit behavior. How would you decide when to use Qdrant recommend versus an external ranking model?

  2. 2

    A business stakeholder wants negative examples to guarantee certain categories never appear. Would you use recommend for that requirement? What would you use instead for a hard constraint?

Follow-up Questions

  • How do negative examples affect a recommendation query?
  • When is a normal vector query preferable to recommend?