> For clean Markdown of any page, append .md to the page URL. > For a complete documentation index, see https://api.qdrant.tech/v-1-17-x/api-reference/search/recommend-batch-points/llms.txt. > For AI client integration (Claude Code, Cursor, etc.), connect to the MCP server at https://api.qdrant.tech/_mcp/server. # Recommend batch points POST http://localhost:6333/collections/{collection_name}/points/recommend/batch Content-Type: application/json Retrieves points in batches that are closer to stored positive examples and further from negative examples. Reference: https://api.qdrant.tech/v-1-18-x/api-reference/search/recommend-batch-points ## Authentication - `api-key` header (required) — API Key authentication via header ## Servers - `http://localhost:6333` (http, default) - `https://localhost:6333` (https) ## Request ### Path parameters - `collection_name` (string, required) — Name of the collection to search in ### Query parameters - `consistency` (ReadConsistency, optional) — Define read consistency guarantees for the operation - `timeout` (integer, optional) — If set, overrides global timeout for this request. Unit is seconds. ### Body (application/json) This endpoint expects a RecommendRequestBatch. - `searches` (list of RecommendRequest, required) ## Response ### 200 successful operation - `usage` (CollectionsCollectionNamePointsRecommendBatchPostResponsesContentApplicationJsonSchemaUsage, optional) - `time` (double, optional) — Time spent to process this request - `status` (string, optional) - `result` (list of list of ScoredPoint, optional) ## Types ### RecommendRequest Recommendation request. Provides positive and negative examples of the vectors, which can be ids of points that are already stored in the collection, raw vectors, or even ids and vectors combined. Service should look for the points which are closer to positive examples and at the same time further to negative examples. The concrete way of how to compare negative and positive distances is up to the `strategy` chosen. - `limit` (integer, required) — Max number of result to return - `shard_key` (RecommendRequestShardKey, optional) — Specify in which shards to look for the points, if not specified - look in all shards - `positive` (list of RecommendExample, optional) — Look for vectors closest to those - `negative` (list of RecommendExample, optional) — Try to avoid vectors like this - `strategy` (RecommendRequestStrategy, optional) — How to use positive and negative examples to find the results - `filter` (RecommendRequestFilter, optional) — Look only for points which satisfies this conditions - `params` (RecommendRequestParams, optional) — Additional search params - `offset` (integer, optional, nullable) — Offset of the first result to return. May be used to paginate results. Note: large offset values may cause performance issues. - `with_payload` (RecommendRequestWithPayload, optional) — Select which payload to return with the response. Default is false. - `with_vector` (RecommendRequestWithVector, optional) — Options for specifying which vectors to include into response. Default is false. - `score_threshold` (double, optional, nullable) — Define a minimal score threshold for the result. If defined, less similar results will not be returned. Score of the returned result might be higher or smaller than the threshold depending on the Distance function used. E.g. for cosine similarity only higher scores will be returned. - `using` (RecommendRequestUsing, optional) — Define which vector to use for recommendation, if not specified - try to use default vector - `lookup_from` (RecommendRequestLookupFrom, optional) — The location used to lookup vectors. If not specified - use current collection. Note: the other collection should have the same vector size as the current collection ### ReadConsistency Read consistency parameter Defines how many replicas should be queried to get the result * `N` - send N random request and return points, which present on all of them * `majority` - send N/2+1 random request and return points, which present on all of them * `quorum` - send requests to all nodes and return points which present on majority of them * `all` - send requests to all nodes and return points which present on all of them Default value is `Factor(1)` ### CollectionsCollectionNamePointsRecommendBatchPostResponsesContentApplicationJsonSchemaUsage ### ScoredPoint Search result - `id` (ExtendedPointId, required) — Type, used for specifying point ID in user interface - `version` (uint64, required) — Point version - `score` (double, required) — Points vector distance to the query vector - `payload` (ScoredPointPayload, optional) — Payload - values assigned to the point - `vector` (ScoredPointVector, optional) — Vector of the point - `shard_key` (ScoredPointShardKey, optional) — Shard Key - `order_value` (ScoredPointOrderValue, optional) — Order-by value ### RecommendRequestShardKey Specify in which shards to look for the points, if not specified - look in all shards ### RecommendExample ### RecommendRequestStrategy How to use positive and negative examples to find the results ### RecommendRequestFilter Look only for points which satisfies this conditions ### RecommendRequestParams Additional search params ### RecommendRequestWithPayload Select which payload to return with the response. Default is false. ### RecommendRequestWithVector Options for specifying which vectors to include into response. Default is false. ### RecommendRequestUsing Define which vector to use for recommendation, if not specified - try to use default vector ### RecommendRequestLookupFrom The location used to lookup vectors. If not specified - use current collection. Note: the other collection should have the same vector size as the current collection ### Usage Usage of the hardware resources, spent to process the request - `hardware` (UsageHardware, optional) - `inference` (UsageInference, optional) ### ExtendedPointId Type, used for specifying point ID in user interface ### ScoredPointPayload Payload - values assigned to the point ### ScoredPointVector Vector of the point ### ScoredPointShardKey Shard Key ### ScoredPointOrderValue Order-by value ### SparseVector Sparse vector structure - `indices` (list of uint, required) — Indices must be unique - `values` (list of double, required) — Values and indices must be the same length ### Filter - `should` (FilterShould, optional) — At least one of those conditions should match - `min_should` (FilterMinShould, optional) — At least minimum amount of given conditions should match - `must` (FilterMust, optional) — All conditions must match - `must_not` (FilterMustNot, optional) — All conditions must NOT match ### SearchParams Additional parameters of the search - `hnsw_ef` (integer, optional, nullable) — Params relevant to HNSW index Size of the beam in a beam-search. Larger the value - more accurate the result, more time required for search. - `exact` (boolean, optional, default: false) — Search without approximation. If set to true, search may run long but with exact results. - `quantization` (SearchParamsQuantization, optional) — Quantization params - `indexed_only` (boolean, optional, default: false) — If enabled, the engine will only perform search among indexed or small segments. Using this option prevents slow searches in case of delayed index, but does not guarantee that all uploaded vectors will be included in search results - `acorn` (SearchParamsAcorn, optional) — ACORN search params ### LookupLocation Defines a location to use for looking up the vector. Specifies collection and vector field name. - `collection` (string, required) — Name of the collection used for lookup - `vector` (string, optional, nullable) — Optional name of the vector field within the collection. If not provided, the default vector field will be used. - `shard_key` (LookupLocationShardKey, optional) — Specify in which shards to look for the points, if not specified - look in all shards ### UsageHardware ### UsageInference ### FilterShould At least one of those conditions should match ### FilterMinShould At least minimum amount of given conditions should match ### FilterMust All conditions must match ### FilterMustNot All conditions must NOT match ### SearchParamsQuantization Quantization params ### SearchParamsAcorn ACORN search params ### LookupLocationShardKey Specify in which shards to look for the points, if not specified - look in all shards ### HardwareUsage Usage of the hardware resources, spent to process the request - `cpu` (integer, required) - `payload_io_read` (integer, required) - `payload_io_write` (integer, required) - `payload_index_io_read` (integer, required) - `payload_index_io_write` (integer, required) - `vector_io_read` (integer, required) - `vector_io_write` (integer, required) ### InferenceUsage - `models` (map from string to ModelUsage, required) ### MinShould - `conditions` (list of Condition, required) - `min_count` (integer, required) ### QuantizationSearchParams Additional parameters of the search - `ignore` (boolean, optional, default: false) — If true, quantized vectors are ignored. Default is false. - `rescore` (boolean, optional, nullable) — If true, use original vectors to re-score top-k results. Might require more time in case if original vectors are stored on disk. If not set, qdrant decides automatically apply rescoring or not. - `oversampling` (double, optional, nullable) — Oversampling factor for quantization. Default is 1.0. Defines how many extra vectors should be pre-selected using quantized index, and then re-scored using original vectors. For example, if `oversampling` is 2.4 and `limit` is 100, then 240 vectors will be pre-selected using quantized index, and then top-100 will be returned after re-scoring. ### AcornSearchParams ACORN-related search parameters - `enable` (boolean, optional, default: false) — If true, then ACORN may be used for the HNSW search based on filters selectivity. Improves search recall for searches with multiple low-selectivity payload filters, at cost of performance. - `max_selectivity` (double, optional, nullable) — Maximum selectivity of filters to enable ACORN. If estimated filters selectivity is higher than this value, ACORN will not be used. Selectivity is estimated as: `estimated number of points satisfying the filters / total number of points`. 0.0 for never, 1.0 for always. Default is 0.4. ### ModelUsage - `tokens` (uint64, required) ### Condition ### FieldCondition All possible payload filtering conditions - `key` (string, required) — Payload key - `match` (FieldConditionMatch, optional) — Check if point has field with a given value - `range` (FieldConditionRange, optional) — Check if points value lies in a given range - `geo_bounding_box` (FieldConditionGeoBoundingBox, optional) — Check if points geolocation lies in a given area - `geo_radius` (FieldConditionGeoRadius, optional) — Check if geo point is within a given radius - `geo_polygon` (FieldConditionGeoPolygon, optional) — Check if geo point is within a given polygon - `values_count` (FieldConditionValuesCount, optional) — Check number of values of the field - `is_empty` (boolean, optional, nullable) — Check that the field is empty, alternative syntax for `is_empty: "field_name"` - `is_null` (boolean, optional, nullable) — Check that the field is null, alternative syntax for `is_null: "field_name"` ### IsEmptyCondition Select points with empty payload for a specified field - `is_empty` (PayloadField, required) — Payload field ### IsNullCondition Select points with null payload for a specified field - `is_null` (PayloadField, required) — Payload field ### HasIdCondition ID-based filtering condition - `has_id` (list of ExtendedPointId, required) ### HasVectorCondition Filter points which have specific vector assigned - `has_vector` (string, required) ### NestedCondition - `nested` (Nested, required) — Select points with payload for a specified nested field ### FieldConditionMatch Check if point has field with a given value ### FieldConditionRange Check if points value lies in a given range ### FieldConditionGeoBoundingBox Check if points geolocation lies in a given area ### FieldConditionGeoRadius Check if geo point is within a given radius ### FieldConditionGeoPolygon Check if geo point is within a given polygon ### FieldConditionValuesCount Check number of values of the field ### PayloadField Payload field - `key` (string, required) — Payload field name ### Nested Select points with payload for a specified nested field - `key` (string, required) - `filter` (Filter, required) ### GeoBoundingBox Geo filter request Matches coordinates inside the rectangle, described by coordinates of lop-left and bottom-right edges - `top_left` (GeoPoint, required) — Geo point payload schema - `bottom_right` (GeoPoint, required) — Geo point payload schema ### GeoRadius Geo filter request Matches coordinates inside the circle of `radius` and center with coordinates `center` - `center` (GeoPoint, required) — Geo point payload schema - `radius` (double, required) — Radius of the area in meters ### GeoPolygon Geo filter request Matches coordinates inside the polygon, defined by `exterior` and `interiors` - `exterior` (GeoLineString, required) — Ordered sequence of GeoPoints representing the line - `interiors` (list of GeoLineString, optional, nullable) — Interior lines (if present) bound holes within the surface each GeoLineString must consist of a minimum of 4 points, and the first and last points must be the same. ### ValuesCount Values count filter request - `lt` (integer, optional, nullable) — point.key.length() \< values\_count.lt - `gt` (integer, optional, nullable) — point.key.length() > values_count.gt - `gte` (integer, optional, nullable) — point.key.length() >= values_count.gte - `lte` (integer, optional, nullable) — point.key.length() \<= values\_count.lte ### GeoPoint Geo point payload schema - `lon` (double, required) - `lat` (double, required) ### GeoLineString Ordered sequence of GeoPoints representing the line - `points` (list of GeoPoint, required) ## Examples **Request** ```json { "searches": [ { "limit": 1 } ] } ``` **Response** ```json { "usage": { "hardware": { "cpu": 1, "payload_io_read": 1, "payload_io_write": 1, "payload_index_io_read": 1, "payload_index_io_write": 1, "vector_io_read": 1, "vector_io_write": 1 }, "inference": { "models": {} } }, "time": 0.002, "status": "ok", "result": [ [ { "id": 42, "version": 3, "score": 0.75, "payload": {}, "vector": {}, "shard_key": "region_1", "order_value": 42 } ] ] } ``` **SDK Code** ```python from qdrant_client import QdrantClient, models client = QdrantClient(url="http://localhost:6333") recommend_queries = [ models.RecommendRequest( positive=[100, 231], negative=[718], filter=filter_, limit=3 ), models.RecommendRequest(positive=[200, 67], negative=[300], limit=3), ] client.recommend_batch(collection_name="{collection_name}", requests=recommend_queries) ``` ```java import java.util.List; import static io.qdrant.client.ConditionFactory.matchKeyword; import static io.qdrant.client.PointIdFactory.id; import io.qdrant.client.QdrantClient; import io.qdrant.client.QdrantGrpcClient; import io.qdrant.client.grpc.Common.Filter; import io.qdrant.client.grpc.Points.RecommendPoints; QdrantClient client = new QdrantClient(QdrantGrpcClient.newBuilder("localhost", 6334, false).build()); Filter filter = Filter.newBuilder().addMust(matchKeyword("city", "London")).build(); List recommendQueries = List.of( RecommendPoints.newBuilder() .addAllPositive(List.of(id(100), id(231))) .addAllNegative(List.of(id(718))) .setFilter(filter) .setLimit(3) .build(), RecommendPoints.newBuilder() .addAllPositive(List.of(id(200), id(67))) .addAllNegative(List.of(id(300))) .setFilter(filter) .setLimit(3) .build()); client.recommendBatchAsync("{collection_name}", recommendQueries, null).get(); ``` ```go package client import ( "context" "fmt" "github.com/qdrant/go-client/qdrant" ) func recommendBatch() { client, err := qdrant.NewClient(&qdrant.Config{ Host: "localhost", Port: 6334, }) if err != nil { panic(err) } results, err := client.QueryBatch(context.Background(), &qdrant.QueryBatchPoints{ CollectionName: "{collection_name}", QueryPoints: []*qdrant.QueryPoints{ { CollectionName: "{collection_name}", Query: qdrant.NewQueryRecommend(&qdrant.RecommendInput{ Positive: []*qdrant.VectorInput{ qdrant.NewVectorInputID(qdrant.NewIDNum(100)), qdrant.NewVectorInputID(qdrant.NewIDNum(231)), }, Negative: []*qdrant.VectorInput{ qdrant.NewVectorInputID(qdrant.NewIDNum(718)), }, }), }, { CollectionName: "{collection_name}", Query: qdrant.NewQueryRecommend(&qdrant.RecommendInput{ Positive: []*qdrant.VectorInput{ qdrant.NewVectorInputID(qdrant.NewIDNum(200)), qdrant.NewVectorInputID(qdrant.NewIDNum(67)), }, Negative: []*qdrant.VectorInput{ qdrant.NewVectorInputID(qdrant.NewIDNum(300)), }, }), }, }, }) if err != nil { panic(err) } fmt.Println("Results: ", results) } ``` ```typescript import { QdrantClient } from "@qdrant/js-client-rest"; const client = new QdrantClient({ host: "localhost", port: 6333 }); const searches = [ { positive: [100, 231], negative: [718], limit: 3, }, { positive: [200, 67], negative: [300], limit: 3, }, ]; client.recommend_batch("{collection_name}", { searches, }); ``` ```rust use qdrant_client::qdrant::{ Condition, Filter, RecommendBatchPointsBuilder, RecommendPointsBuilder, }; use qdrant_client::Qdrant; let client = Qdrant::from_url("http://localhost:6334").build()?; let filter = Filter::must([Condition::matches("city", "London".to_string())]); let recommend_queries = vec![ RecommendPointsBuilder::new("{collection_name}", 3) .add_positive(100) .add_positive(231) .add_negative(718) .filter(filter.clone()) .build(), RecommendPointsBuilder::new("{collection_name}", 3) .add_positive(200) .add_positive(67) .add_negative(300) .filter(filter.clone()) .build(), ]; client .recommend_batch(RecommendBatchPointsBuilder::new( "{collection_name}", recommend_queries, )) .await?; ``` ```csharp using Qdrant.Client; using Qdrant.Client.Grpc; using static Qdrant.Client.Grpc.Conditions; var client = new QdrantClient("localhost", 6334); var filter = MatchKeyword("city", "london"); await client.RecommendBatchAsync( collectionName: "{collection_name}", recommendSearches: [ new() { CollectionName = "{collection_name}", Positive = { new PointId[] { 100, 231 } }, Negative = { new PointId[] { 718 } }, Limit = 3, Filter = filter, }, new() { CollectionName = "{collection_name}", Positive = { new PointId[] { 200, 67 } }, Negative = { new PointId[] { 300 } }, Limit = 3, Filter = filter, } ] ); ``` ```ruby require 'uri' require 'net/http' url = URI("http://localhost:6333/collections/collection_name/points/recommend/batch") http = Net::HTTP.new(url.host, url.port) request = Net::HTTP::Post.new(url) request["api-key"] = '' request["Content-Type"] = 'application/json' request.body = "{\n \"searches\": [\n {\n \"limit\": 1\n }\n ]\n}" response = http.request(request) puts response.read_body ``` ```php request('POST', 'http://localhost:6333/collections/collection_name/points/recommend/batch', [ 'body' => '{ "searches": [ { "limit": 1 } ] }', 'headers' => [ 'Content-Type' => 'application/json', 'api-key' => '', ], ]); echo $response->getBody(); ``` ```swift import Foundation let headers = [ "api-key": "", "Content-Type": "application/json" ] let parameters = ["searches": [["limit": 1]]] as [String : Any] let postData = JSONSerialization.data(withJSONObject: parameters, options: []) let request = NSMutableURLRequest(url: NSURL(string: "http://localhost:6333/collections/collection_name/points/recommend/batch")! as URL, cachePolicy: .useProtocolCachePolicy, timeoutInterval: 10.0) request.httpMethod = "POST" request.allHTTPHeaderFields = headers request.httpBody = postData as Data let session = URLSession.shared let dataTask = session.dataTask(with: request as URLRequest, completionHandler: { (data, response, error) -> Void in if (error != nil) { print(error as Any) } else { let httpResponse = response as? HTTPURLResponse print(httpResponse) } }) dataTask.resume() ```