id stringlengths 36 36 | url stringclasses 504
values | title stringclasses 475
values | section stringlengths 0 148 | content_type stringclasses 3
values | has_code bool 2
classes | text stringlengths 147 22.5k | vector listlengths 384 384 |
|---|---|---|---|---|---|---|---|
447a7996-cdc2-5556-9286-4287758785b1 | /documentation/tutorials-basics/reranking-hybrid-search/ | Hybrid Search with Reranking | Overview > Retrieval Stage | documentation | false | Hybrid Search with Reranking > Overview > Retrieval Stage
When a user submits a **query**, it is, just like documents, transformed into dense embeddings for semantic search and late interaction embeddings for precise reranking. For keyword search, Qdrant processes the query text with the same text processing as the fu... | [
0.040941186249256134,
-0.035532768815755844,
-0.05017418414354324,
-0.047951795160770416,
0.0725795328617096,
-0.04954119771718979,
0.07335162907838821,
0.032000645995140076,
0.10070396214723587,
-0.023695487529039383,
0.036038756370544434,
-0.0020326569210737944,
0.06589009612798691,
-0.0... |
449989ba-ca14-529b-889e-21c45f37b813 | /documentation/tutorials-operations/gpu-accelerated-hnsw-indexing/ | GPU-Accelerated HNSW Indexing | GPU vs. CPU Comparison | documentation | false | GPU-Accelerated HNSW Indexing > GPU vs. CPU Comparison
For this 100,000-vector workload on Qdrant v1.19, GPU-accelerated indexing **cut the re-indexing window by an order of magnitude** without introducing the latency spikes the CPU-only build showed. | [
0.0006398495752364397,
-0.05467170476913452,
-0.06412627547979355,
-0.04659377038478851,
0.07328414916992188,
-0.012454405426979065,
0.041836246848106384,
0.041583288460969925,
0.09434181451797485,
-0.03884054720401764,
0.040068287402391434,
0.034367769956588745,
0.057822175323963165,
-0.0... |
44a96b9e-5bd5-53ac-9f91-e0fa869c7d48 | /documentation/send-data/databricks/ | Databricks Ingestion | Download a Dataset | documentation | true | Databricks Ingestion > Download a Dataset
Install the required dependencies:
```python
%pip install fastembed==0.9.0 datasets==5.1.0
```
Restart Python after installation, then run the remaining cells in order:
```python
dbutils.library.restartPython()
```
Download the dataset:
```python
from datasets import load... | [
0.03208697959780693,
-0.026712480932474136,
0.002076084027066827,
-0.03662325069308281,
0.04045434668660164,
-0.03566683828830719,
0.0015919320285320282,
0.06413178145885468,
0.014101839624345303,
-0.017370006069540977,
0.03803751617670059,
0.019373668357729912,
0.06135154888033867,
0.0004... |
44ac3c47-6e06-52dc-a800-743b200d7267 | /documentation/search/search-relevance/ | Search Relevance | Relevance Feedback | documentation | false | Search Relevance > Relevance Feedback
*Available as of 1.17*
Relevance feedback distills signals from current search results into the next retrieval iteration to surface more relevant documents.
Qdrant provides a subtype of relevance feedback-based retrieval, where feedback is given by any model (relevance oracle) i... | [
0.03829731419682503,
-0.051877982914447784,
-0.046307649463415146,
-0.05336949601769447,
0.04797882214188576,
-0.021743161603808403,
0.05774968862533569,
0.022876514121890068,
0.06545630842447281,
0.011682928539812565,
0.04074183106422424,
-0.0024386427830904722,
0.07702808827161789,
-0.01... |
44ade652-6d48-5fe1-b7da-4c02622dc319 | /documentation/production-operations/vector-search-in-production/ | Vector Search in Production: Scaling, HA & Tuning Guide | 3. What's the Best Way to Scale the Database and Optimize Resources? | documentation | false | Vector Search in Production: Scaling, HA & Tuning Guide > 3. What's the Best Way to Scale the Database and Optimize Resources?
||
|:-:|
|**"How many nodes, CPUs, RAM and storage do I need for my Qdrant Cluster?"**|
It depends. If you're just starting out - we have prepared a tool on our website to help you figure thi... | [
0.021147606894373894,
-0.04341283440589905,
-0.05397919565439224,
-0.03818024694919586,
0.060528241097927094,
-0.04544268175959587,
0.05220645293593407,
0.01579233631491661,
0.0891820415854454,
-0.04597446322441101,
0.023233693093061447,
-0.006264508701860905,
0.02995232678949833,
-0.05072... |
44b18f28-bfc0-5ad3-8ba0-c44f781ecceb | /articles/dataset-quality/ | Detecting Dataset Errors with Similarity Search | Furniture web-marketplace > Similarity search | article | false | Detecting Dataset Errors with Similarity Search > Furniture web-marketplace > Similarity search
The idea behind similarity search is to measure semantic similarity between related parts of the data.
E.g. between category title and item images.
The hypothesis is, that unsuitable items will be less similar.
We can't di... | [
0.0591670423746109,
-0.04363829270005226,
-0.06963302940130234,
-0.01064432505518198,
0.060484521090984344,
-0.0275866836309433,
0.07547102123498917,
0.04449716582894325,
0.027980726212263107,
0.005051390267908573,
0.03902682662010193,
0.04596022143959999,
0.04887095093727112,
-0.030013734... |
44c36010-d0fa-56ed-9ea5-e1c287d4f629 | /documentation/tutorials-operations/prevent-unoptimized-usage/ | Prevent Unoptimized Usage | Monitor Optimization Progress | documentation | true | Prevent Unoptimized Usage > Monitor Optimization Progress
Poll `get_collection` for the number of deferred points, and `get_optimizations` for running and queued optimization jobs, until both queues drain.
```python
import asyncio
import time
async def get_optimizations_progress(signal: asyncio.Event, collection_nam... | [
0.01707952283322811,
-0.019374368712306023,
-0.02590607851743698,
-0.016726166009902954,
0.07437873631715775,
-0.03647696599364281,
0.030261551961302757,
0.03338257595896721,
0.057644739747047424,
-0.015785520896315575,
0.03806469962000847,
0.030690278857946396,
0.04852753505110741,
-0.050... |
44c95fa4-0200-5ada-b578-3a504a36da01 | /documentation/search/hybrid-queries/ | Hybrid Queries | Hybrid Search > Reciprocal Rank Fusion (RRF) | documentation | true | Hybrid Queries > Hybrid Search > Reciprocal Rank Fusion (RRF)
RRF considers the positions of results within each query and boosts those that appear closer to the top in multiple sets of results. The score of a document is calculated using its rank in each result set:
$$ score(d\in D) = \sum_{r_d\in R(d)} \frac{1}{k +... | [
0.046123992651700974,
-0.03340142220258713,
-0.051381099969148636,
-0.05374192073941231,
0.07067554444074631,
-0.03882313519716263,
0.05340695008635521,
0.03794215992093086,
0.07053714990615845,
-0.030969809740781784,
0.02245868369936943,
0.005987611599266529,
0.033469267189502716,
0.00228... |
44d512f6-565a-5660-865b-4a8caa161d31 | /articles/filtered-vector-search-acorn/ | Filtered Vector Search: What ACORN Fixes, and What Fixes ACORN | What to Measure on Your Own Collection | article | false | Filtered Vector Search: What ACORN Fixes, and What Fixes ACORN > What to Measure on Your Own Collection
Measure recall for each filter shape you serve. Start with the ones most likely to break: values covering roughly a fifth of the collection or more, and `AND` combinations of them. [Facet counts](/documentation/mana... | [
0.04712744429707527,
-0.07366245239973068,
-0.04079064354300499,
-0.021670116111636162,
0.05917075276374817,
0.0008473707130178809,
0.04049854725599289,
0.01555014867335558,
0.07779478281736374,
-0.028582826256752014,
0.02772027999162674,
0.026424776762723923,
0.06617110222578049,
-0.01324... |
44dafe46-b633-5e7c-a5a2-ce192bab62e8 | /documentation/hybrid-cloud/platform-deployment-options/ | Deployment Platforms | STACKIT | documentation | true | Deployment Platforms > STACKIT
[STACKIT Kubernetes Engine (SKE)](https://www.stackit.de/en/product/kubernetes/) is a robust, scalable, and managed Kubernetes service. SKE supplies a CNCF-compliant Kubernetes cluster and makes it easy to provide standard Kubernetes applications and containerized workloads. User-defined... | [
0.03607296571135521,
-0.037155259400606155,
-0.04019379988312721,
-0.053331177681684494,
0.010670442134141922,
-0.03212255612015724,
0.05161917582154274,
0.0531553216278553,
0.04430341720581055,
-0.04182156175374985,
0.025453785434365273,
-0.004251023754477501,
-0.005402678623795509,
-0.04... |
44dce13e-67d9-5e42-9534-0f5d9869f5fd | /course/beginners/module-5/analyst-queries/ | Analyst Queries | Try It | course | false | Analyst Queries > Try It
Open the notebook and work through these against the collection you just built:
1. Ingest a satellite capture with its `caption` set to an empty string, then run `cluster_and_tag` for that supplier. Confirm the point never appears in a cluster, and find the line in `dense_matrix` that drops i... | [
0.07929976284503937,
-0.03484764322638512,
-0.047637250274419785,
-0.02585659921169281,
0.06454097479581833,
-0.021757537499070168,
0.022612372413277626,
0.012079209089279175,
0.05539747327566147,
-0.02692960761487484,
0.03603457286953926,
0.029885176569223404,
0.0586225725710392,
-0.01078... |
44f42a3d-704e-52d6-8c3e-4b3384724af1 | /documentation/production-operations/vector-search-in-production/ | Vector Search in Production: Scaling, HA & Tuning Guide | 2. How do I Ingest and Index Large Amounts of Data? > When Indexing Falls Behind Ingestion | documentation | false | Vector Search in Production: Scaling, HA & Tuning Guide > 2. How do I Ingest and Index Large Amounts of Data? > When Indexing Falls Behind Ingestion
> It's possible for indexing to temporarily fall behind data ingestion, both during gradual streaming uploads and after large bulk uploads.
By default, searches include ... | [
0.03147800266742706,
-0.05512922629714012,
-0.04849983751773834,
-0.020512204617261887,
0.0537816658616066,
-0.04248873516917229,
0.03973103687167168,
0.02151242084801197,
0.0971616804599762,
-0.008591588586568832,
0.03958682715892792,
0.04353003948926926,
0.03250863030552864,
-0.039049193... |
4513533a-b65c-5145-b474-7d03b389a76e | /documentation/tutorials-operations/blue-green-deployment/ | Blue-Green Cluster Deployment | Step 1: Create the New Cluster | documentation | false | Blue-Green Cluster Deployment > Step 1: Create the New Cluster
Create a new cluster. This will be the green cluster. Configure it the way you want the end state to look:
- If you are upgrading Qdrant, **pick the target version explicitly**. Do not accept the default version without checking. The version you choose he... | [
0.03723156824707985,
-0.0637674629688263,
-0.04009605199098587,
-0.049723945558071136,
0.07661636918783188,
-0.034646254032850266,
0.04740065708756447,
0.03594791516661644,
0.051563382148742676,
-0.027095673605799675,
0.00779143488034606,
0.01703992858529091,
0.026735132560133934,
-0.04487... |
451d0f95-d5e7-51b5-8704-0e80a08b55b4 | /documentation/observability/newrelic/ | New Relic | documentation | true | New Relic
[New Relic](https://newrelic.com/) is an observability platform that collects metrics, traces, and logs from servers, databases, and applications. It provides dashboards, alerting, and NRQL queries to analyze the performance of your infrastructure.
Qdrant exposes metrics in the Prometheus/OpenMetrics format... | [
0.010748456232249737,
-0.026555035263299942,
-0.048122700303792953,
-0.014361212961375713,
0.06924975663423538,
-0.018667399883270264,
0.060775358229875565,
0.06120183691382408,
0.044386737048625946,
-0.03979324549436569,
0.025187404826283455,
-0.008621370419859886,
0.08639418333768845,
-0... | |
453b0d57-5229-52d7-bc6f-d7a922353888 | /course/essentials/day-3/sparse-retrieval-demo/ | Demo: Keyword Search with Sparse Vectors | Best Matching 25 (BM25) > BM25 in Qdrant > Lexical Retrieval with BM25 & Qdrant | course | false | Demo: Keyword Search with Sparse Vectors > Best Matching 25 (BM25) > BM25 in Qdrant > Lexical Retrieval with BM25 & Qdrant
$$
\text{IDF}(\text{"cheese"}) \cdot \mathrm{function}\left(\mathrm{TF}(\text{"cheese"}, D), k_1, b, |D|, \mathrm{avg}_{\text{corpus}}|D|\right)
$$
**Step 4**
The final similarity score between ... | [
0.08629825711250305,
-0.04085587337613106,
-0.03540322184562683,
-0.05439455434679985,
0.0684991329908371,
-0.033742450177669525,
0.07496622204780579,
0.02223493903875351,
0.08511032164096832,
-0.012085238471627235,
0.04674479737877846,
0.0031826156191527843,
0.05657939240336418,
-0.031975... |
45599336-fd7a-5aab-a8c6-258c76cc4383 | /documentation/embeddings/mixedbread/ | Mixedbread | Models | documentation | false | Mixedbread > Models
| Model | Dimensions | Reducible | Max Tokens per Input | Languages |
|---|---|---|---|---|
| `mxbai-embed-large-v1` | 1024 | Yes | 512 | English |
| `mxbai-embed-xsmall-v1` | 384 | Yes | 4096 | English |
| `deepset-mxbai-embed-de-large-v1` | 1024 | Yes | 512 | German, English |
On Hugging Face, e... | [
0.04773188754916191,
-0.02092704549431801,
-0.03506884351372719,
-0.06139952316880226,
0.08437053859233856,
-0.05528677627444267,
0.06711605936288834,
0.06876488029956818,
0.03706417232751846,
-0.07380666583776474,
0.029425015673041344,
0.017655665054917336,
0.04064379259943962,
-0.0503444... |
455b21af-2b5a-5e64-8c63-ece9283c581d | /documentation/search-evaluation/pipeline-output-quality/ | Evaluating Pipeline Output Quality | Isolating Retrieval vs Generation | documentation | false | Evaluating Pipeline Output Quality > Isolating Retrieval vs Generation
If you're also running [retrieval evaluation](/documentation/search-evaluation/retrieval-relevance/) against the same golden set, pairing the two scores on every run gives a diagnostic 2x2 for attributing score changes. When a metric drops after a ... | [
0.007768745068460703,
-0.006960124708712101,
-0.05120148882269859,
-0.023151474073529243,
0.05456532537937164,
-0.027761993929743767,
0.06216222792863846,
0.03397470712661743,
0.04168892651796341,
-0.059888843446969986,
-0.0015133125707507133,
0.024503059685230255,
0.06390701979398727,
-0.... |
4570e684-d1af-5077-b1eb-57f7fc5ee39a | /course/essentials/day-5/universal-query-demo/ | Demo: Universal Query for Hybrid Retrieval | Step 1: Create the Research Paper Collection | course | true | Demo: Universal Query for Hybrid Retrieval > Step 1: Create the Research Paper Collection
### Initialize the Collection with Vector Configurations
First, let's set up a collection with three vector types - each serving a different purpose in our research discovery pipeline:
```python
from datetime import datetime, t... | [
0.03470085561275482,
-0.027663005515933037,
-0.05025048926472664,
-0.041156649589538574,
0.0787322148680687,
-0.025436779484152794,
0.04210991784930229,
0.06747972965240479,
0.08216724544763565,
-0.03326386958360672,
0.03308497741818428,
0.06121865287423134,
0.037015531212091446,
-0.011987... |
45866445-583c-56b3-9b7b-aaa8ede988e6 | /articles/memory-consumption/ | Minimal RAM to Serve 1M Vectors | Let's run some benchmarks > Vectors and HNSW graph stored using MMAP | article | true | Minimal RAM to Serve 1M Vectors > Let's run some benchmarks > Vectors and HNSW graph stored using MMAP
In the third experiment, we tested how well our system performs when vectors and [HNSW](https://qdrant.tech/articles/filterable-hnsw/) graph are stored using the memory-mapped files.
Create collection with:
```http
... | [
0.016701573505997658,
-0.05953884869813919,
-0.049229010939598083,
-0.03692198544740677,
0.07354852557182312,
-0.04151386395096779,
0.03019854798913002,
0.04698553308844566,
0.08021204173564911,
-0.013552919030189514,
0.00012364682334009558,
0.010411820374429226,
0.0684877410531044,
-0.037... |
458d155f-76d5-5724-9024-a3aa1c32b1c5 | /course/essentials/day-7/jina/ | Integrating with Jina AI | Resources | course | false | Integrating with Jina AI > Resources
- [Build a RAG System with Jina Embeddings and Qdrant](https://jina.ai/news/build-a-rag-system-with-jina-embeddings-and-qdrant/):
Official Jina AI guide on building RAG systems with Jina Embeddings v2 and Qdrant. Learn how to create retrieval-augmented generation engines using ... | [
0.032909974455833435,
-0.04455096274614334,
-0.05024374648928642,
-0.05186013877391815,
0.09254767745733261,
-0.036619167774915695,
0.055364836007356644,
0.0672932043671608,
0.035976771265268326,
-0.0424610897898674,
0.07105518132448196,
-0.007154131308197975,
0.05720056965947151,
-0.04454... |
4590a113-7259-53ce-97b2-efed5a3f5909 | /documentation/tutorials-search-engineering/pdf-retrieval-at-scale/ | Multivector Document Retrieval | How VLLMs Work for PDF Retrieval | documentation | false | Multivector Document Retrieval > How VLLMs Work for PDF Retrieval
VLLMs like **ColPali** and **ColQwen** generate **multivector representations** for each PDF page; the representations are stored and indexed in a vector database. During the retrieval process, models dynamically create multivector representations for (... | [
0.024650489911437035,
-0.02582855336368084,
-0.052735280245542526,
-0.04718465358018875,
0.08664906769990921,
-0.002520821988582611,
0.060852181166410446,
0.039087168872356415,
0.0535745732486248,
0.009635514579713345,
0.02656061202287674,
-0.024507632479071617,
0.04203788563609123,
-0.007... |
45a46eab-b525-5055-b85b-a9cea59e41f4 | /documentation/manage-data/collections/ | Collections | Collection Info > Collection Metadata | documentation | true | Collections > Collection Info > Collection Metadata
*Available as of v1.16.0*
For convenience and better data organization, Qdrant allows attaching custom metadata to collections in the form of key-value pairs.
Adding metadata is treated as a part of collection configuration and synchronized across all nodes in a clu... | [
0.016171736642718315,
-0.03357592225074768,
-0.0674932599067688,
-0.032866090536117554,
0.01978696696460247,
-0.08517936617136002,
0.044578276574611664,
0.09750258922576904,
0.06024714559316635,
-0.03467573970556259,
0.036575958132743835,
0.018495483323931694,
0.058405861258506775,
-0.0249... |
45b88888-09c9-5157-b6f3-f698b37d8d59 | /course/beginners/module-4/where-design-decisions-live/ | Where Design Decisions Live | course | false | Where Design Decisions Live
Module 4
A vector search system has five layers. The first four go from easiest to hardest to change. Distribution is separate, because its cost depends on which change you make, and [Growing Past One Machine](/course/beginners/module-4/growing-past-one-machine/) covers it.
 > Advanced Filtering: Nested Objects | course | true | Points, Vectors and Payloads > Payloads (Metadata) > Advanced Filtering: Nested Objects
For complex data structures like arrays of objects, Qdrant provides nested filtering that ensures conditions are evaluated within individual array elements rather than across all elements.
Consider a product with multiple reviews:... | [
0.05730244889855385,
-0.04246101528406143,
-0.05213174968957901,
-0.04514617100358009,
0.030560344457626343,
-0.004453173838555813,
0.07166672497987747,
0.06747325509786606,
0.08821998536586761,
-0.023960880935192108,
0.031810835003852844,
0.054193418473005295,
0.09074211120605469,
0.00116... |
46015552-715a-58e6-939f-4694549208af | /documentation/private-cloud/api-reference/ | API Reference | qdrant.io/v1 > Resource Types > RestoreSource | documentation | false | API Reference > qdrant.io/v1 > Resource Types > RestoreSource
_Appears in:_
- [QdrantClusterRestoreSpec](#qdrantclusterrestorespec)
| Field | Description | Default | Validation |
| --- | --- | --- | --- |
| `snapshotName` _string_ | SnapshotName is the name of the snapshot from which we wish to restore | | |
| `nam... | [
0.058906231075525284,
-0.04095332697033882,
0.007686584256589413,
-0.0619535967707634,
0.05529310181736946,
-0.03273957595229149,
0.04796411469578743,
0.00284215877763927,
0.03918381780385971,
-0.05915350466966629,
0.046862997114658356,
0.013498052023351192,
0.05905567854642868,
-0.0042322... |
4602616c-bb16-5df2-8968-8ea373c39b25 | /course/essentials/certification/ | Qdrant Essentials Certification | course | false | Qdrant Essentials Certification
Congratulations! You’ve officially navigated the complexities of the **Qdrant Essentials** course. You didn’t just learn how to store data; you learned how to architect a high-performance **Vector Search Engine**.
You’ve moved past simple "Hello World" tutorials and dove deep into HNSW... | [
0.03240884095430374,
-0.051022835075855255,
-0.052548598498106,
-0.04859542474150658,
0.02776842936873436,
-0.0735054612159729,
0.0475359708070755,
0.0499517023563385,
0.0782010406255722,
-0.04918918013572693,
0.018892742693424225,
0.03857903555035591,
0.05450025200843811,
-0.0567193478345... | |
460abdcb-bb75-51af-9bcd-d54cf17efaba | /course/essentials/day-5/universal-query-demo/ | Demo: Universal Query for Hybrid Retrieval | Next | course | false | Demo: Universal Query for Hybrid Retrieval > Next
In the next lesson, you'll take this foundation and build a complete recommendation service with real data ingestion and user profiling. | [
0.029096055775880814,
0.014164973981678486,
-0.04679606854915619,
-0.06127225607633591,
0.05364995077252388,
-0.033197153359651566,
0.04382631927728653,
0.05910494923591614,
0.08313023298978806,
-0.028723305091261864,
0.03181222081184387,
0.05777116119861603,
0.09753047674894333,
-0.027975... |
4629e4ca-1599-5858-84b6-e60c3abbc405 | /course/beginners/module-5/clustering-risk-signals/ | Clustering Risk Signals | Querying With a Centroid | course | true | Clustering Risk Signals > Querying With a Centroid
A centroid is just a vector, so it can be a query. This is how you find older signals about a theme that only became visible today:
```python
def signals_like_cluster(centroid, limit: int = 20):
return client.query_points(
collection_name="supplier_signal... | [
0.014337730593979359,
-0.02254205383360386,
-0.07575128972530365,
-0.04321110621094704,
0.059821244329214096,
-0.019339056685566902,
0.07272157073020935,
0.06545550376176834,
0.11224935948848724,
-0.030100228264927864,
0.033998072147369385,
0.012339238077402115,
0.037416085600852966,
0.001... |
463307f0-5ac3-5d5b-94df-3edb726826ca | /articles/minicoil-en-es/ | miniCOIL EN-ES: Sparse Neural Retrieval Across the Language Barrier | Training miniCOIL EN-ES > Implementation Details | article | false | miniCOIL EN-ES: Sparse Neural Retrieval Across the Language Barrier > Training miniCOIL EN-ES > Implementation Details
The training code is open source in the [pentoai/minicoil-en-es](https://github.com/pentoai/minicoil-en-es) repository.
Model and training configuration
| Component | Description |
| --- | --- |
| *... | [
0.04490611329674721,
-0.03218367323279381,
-0.02762404829263687,
-0.03873531520366669,
0.07744520902633667,
-0.050556786358356476,
0.06648586690425873,
0.051253776997327805,
0.06763633340597153,
-0.03582910820841789,
0.02679215930402279,
0.01283615455031395,
0.07047862559556961,
-0.0407893... |
4646c77c-f29f-57ff-836c-5364d796112f | /documentation/search-precision/reranking-semantic-search/ | Reranking for Better Search | Implementing Vector Search with Reranking > Implementation > Retrieval | documentation | true | Reranking for Better Search > Implementing Vector Search with Reranking > Implementation > Retrieval
The first few steps here mirror what we did during ingestion—just like before, we need to convert the query into an embedding:
```python
query_embeddings = co.embed(texts=[query],
model=model... | [
0.036783091723918915,
-0.08719176054000854,
-0.04562428593635559,
-0.03801892325282097,
0.09307458996772766,
-0.03672685846686363,
0.03412212058901787,
0.026197873055934906,
0.07551608979701996,
0.006997554562985897,
0.007925144396722317,
0.038835350424051285,
0.04547195881605148,
-0.02662... |
4647af72-df30-51a8-bbad-19ef0c0218ec | /documentation/scaling/distributed_deployment/ | Distributed Deployment | Making Use of a New Distributed Qdrant Cluster | documentation | false | Distributed Deployment > Making Use of a New Distributed Qdrant Cluster
When you enable distributed mode and scale up to two or more nodes, your data does not move to the new node automatically; it starts out empty. To make use of your new empty node, do one of the following:
* Create a new replicated collection by s... | [
0.05174613744020462,
-0.038571879267692566,
-0.05799909681081772,
-0.030627042055130005,
0.10372878611087799,
-0.03286640718579292,
0.04425838589668274,
0.037397924810647964,
0.0419943742454052,
-0.043610040098428726,
0.04369047284126282,
-0.010053194127976894,
0.03133367747068405,
-0.0106... |
465b6c64-f4a4-58f5-b471-002448ae9f40 | /articles/modern-sparse-neural-retrieval/ | Modern Sparse Neural Retrieval: From DeepCT to SPLADE++ | Sparse Neural Retrieval Evolution > Back to the Roots | article | false | Modern Sparse Neural Retrieval: From DeepCT to SPLADE++ > Sparse Neural Retrieval Evolution > Back to the Roots
[`Universal COntextualized Inverted List (UniCOIL)`](https://arxiv.org/pdf/2106.14807), made by the authors of COIL as a follow-up, goes back to producing a scalar value as the importance score
rather than ... | [
0.0586516447365284,
-0.039242323487997055,
-0.007023797836154699,
-0.03227822855114937,
0.041452556848526,
-0.02485330030322075,
0.06739318370819092,
0.043471042066812515,
0.06249575689435005,
-0.020876070484519005,
0.00854567438364029,
0.03661220148205757,
0.05691838264465332,
-0.01261524... |
468cb10d-b860-57f5-8ced-e5a0a487df87 | /documentation/cloud/backups/ | Backup Clusters | documentation | false | Backup Clusters
Qdrant organizes cloud instances as clusters. On occasion, you may need to
restore your cluster because of application or system failure.
You may already have a source of truth for your data in a regular database. If you
have a problem, you could reindex the data into your Qdrant vector search cluster... | [
0.023318009451031685,
-0.04981659725308418,
-0.021819401532411575,
-0.036301080137491226,
0.08336689323186874,
-0.03709641471505165,
0.07945851981639862,
0.027925975620746613,
0.04256681352853775,
-0.009718373417854309,
0.036222659051418304,
0.033558476716279984,
0.04082944989204407,
-0.03... | |
4696edeb-d477-5849-8bd3-734a5576e429 | /documentation/private-cloud/api-reference/ | API Reference | qdrant.io/v1 > Resource Types > NodeStatus | documentation | false | API Reference > qdrant.io/v1 > Resource Types > NodeStatus
| Field | Description | Default | Validation |
| --- | --- | --- | --- |
| `name` _string_ | Name specifies the name of the node | | Optional: \{\} |
| `started_at` _string_ | StartedAt specifies the time when the node started (in RFC3339 format) | | Option... | [
0.03844381123781204,
-0.06505496799945831,
-0.005338503047823906,
-0.036084581166505814,
0.04475143551826477,
-0.048058852553367615,
0.0511292964220047,
0.049446720629930496,
0.05380118265748024,
-0.029934905469417572,
0.041728295385837555,
-0.0009956051362678409,
0.029973242431879044,
-0.... |
46b44c3e-10f9-5091-926e-43f5b1527abe | /documentation/private-cloud/configuration/ | Configuration | documentation | true | Configuration
The Qdrant Private Cloud Helm chart has several configuration options. These configure the Operator itself and the fleet-wide defaults it applies to every Qdrant database it manages, such as the database image, log level and storage performance settings.
Settings that differ per cluster are not set here... | [
0.06221948191523552,
-0.053225044161081314,
-0.033792685717344284,
-0.026911204680800438,
0.03719296678900719,
-0.07412656396627426,
0.041165683418512344,
0.07425165176391602,
0.01686394214630127,
-0.013201705180108547,
0.020562252029776573,
0.025512412190437317,
0.060420796275138855,
-0.0... | |
46b6e83d-27d0-5053-be5f-3a9843c059f1 | /course/multi-vector-search/module-1/late-interaction-basics/ | Late Interaction Basics | Understanding the Alternatives > Single-Vector Embeddings (No Interaction) | course | true | Late Interaction Basics > Understanding the Alternatives > Single-Vector Embeddings (No Interaction)
The most common approach encodes each document and query into a single dense vector, then compares them using similarity (most often cosine similarity).
**The strength:** This method is simple, fast, and scales well. ... | [
0.03343444690108299,
-0.05611088499426842,
-0.07629436999559402,
-0.05578205734491348,
0.056601632386446,
-0.023463675752282143,
0.05944088101387024,
0.025235461071133614,
0.08486738801002502,
-0.02610570564866066,
0.024262430146336555,
-0.002259046770632267,
0.04054013639688492,
-0.019933... |
46de77a3-1ee2-511f-96d2-99d5a4d1cb9a | /course/beginners/module-3/the-two-families-of-search/ | The Two Families of Search | Dense and Sparse, Side by Side | course | false | The Two Families of Search > Dense and Sparse, Side by Side
Module 1 covered the strengths of dense vectors, and those strengths apply here too. Dense vectors handle synonyms, paraphrases, and intent well, but they can miss cases where one exact token carries the meaning, such as a serial number, rare term, or invente... | [
0.023932652547955513,
-0.024551598355174065,
-0.05879611894488335,
-0.06181422248482704,
0.052352435886859894,
-0.06852993369102478,
0.07696698606014252,
0.014743941836059093,
0.07764270901679993,
-0.033372316509485245,
0.02789875492453575,
0.041986145079135895,
0.04276146739721298,
-0.006... |
471cbdae-27ff-5904-bcc4-696e2afccd37 | /articles/search-feedback-loop/ | Relevance Feedback in Information Retrieval | Two Ways to Approach the Problem | article | false | Relevance Feedback in Information Retrieval > Two Ways to Approach the Problem
Retrieval as a recipe can be broken down into three main ingredients:
1. Query
2. Documents
3. Similarity scoring between them.
Click a node in the taxonomy to expand it, or highlight the methods built for lexical or neural search.

| Field | Description | Default | Validation |
| --- | --- ... | [
0.022978128865361214,
-0.028099767863750458,
-0.022311601787805557,
-0.06001878157258034,
0.05128613859415054,
-0.039914265275001526,
0.06344326585531235,
0.06293317675590515,
0.05308384448289871,
-0.0473138764500618,
0.06608042120933533,
-0.007854286581277847,
0.04779035598039627,
-0.0181... |
47460e21-38b4-5433-bdcd-e36a736a9775 | /articles/minicoil-en-es/ | miniCOIL EN-ES: Sparse Neural Retrieval Across the Language Barrier | Building a Concept Vocabulary > Dictionary as a Graph | article | false | miniCOIL EN-ES: Sparse Neural Retrieval Across the Language Barrier > Building a Concept Vocabulary > Dictionary as a Graph
To build the concept vocabulary we use the [MUSE bilingual dictionaries](https://github.com/facebookresearch/MUSE): about 112k English-to-Spanish and a same-ish amount of Spanish-to-English pairs... | [
0.03612681105732918,
-0.019114142283797264,
-0.04167916253209114,
-0.04736931249499321,
0.09897447377443314,
-0.059807632118463516,
0.046804435551166534,
0.026891326531767845,
0.06124619022011757,
-0.04949207603931427,
0.037309370934963226,
0.016299454495310783,
0.05436059832572937,
-0.017... |
474da0c8-25a4-59ae-a890-f8160b47d1b3 | /documentation/ops-configuration/administration/ | Administration | Strict Mode > Disable Exact Search | documentation | true | Administration > Strict Mode > Disable Exact Search
Exact search bypasses the HNSW index and performs a brute-force scan, which can be very slow on large collections.
Setting `search_allow_exact` to false prevents clients from requesting exact search.
```python
from qdrant_client import QdrantClient, models
client ... | [
0.012909558601677418,
-0.028347153216600418,
-0.04078406095504761,
-0.002331536030396819,
0.05224462226033211,
-0.017658013850450516,
0.024212663993239403,
0.018207240849733353,
0.06527076661586761,
-0.03426927328109741,
0.05192483216524124,
0.05971992015838623,
0.08244936168193817,
0.0012... |
475c464e-221c-5ee6-a236-c0912b630634 | /course/essentials/day-4/pitstop-project/ | Project: Quantization Performance Optimization | course | false | Project: Quantization Performance Optimization
Day 4
Apply quantization techniques to your domain search engine and measure the real-world impact on speed, memory, and accuracy. You'll discover how different quantization methods affect your specific use case and learn to optimize the accuracy recovery pipeline. | [
0.048614501953125,
-0.02249499410390854,
-0.023114852607250214,
-0.028349338099360466,
0.07199285924434662,
-0.01846417970955372,
0.026802178472280502,
0.028089161962270737,
0.06697023659944534,
0.0028462205082178116,
-0.0018919316353276372,
0.03554448112845421,
0.062414027750492096,
-0.04... | |
476844cd-1d20-5da3-a42e-37c9f851a61e | /documentation/observability/openllmetry/ | OpenLLMetry | documentation | true | OpenLLMetry
OpenLLMetry from [Traceloop](https://www.traceloop.com/) is a set of extensions built on top of [OpenTelemetry](https://opentelemetry.io/) that gives you complete observability over your LLM application.
OpenLLMetry supports instrumenting the `qdrant_client` Python library and exporting the traces to vari... | [
0.038618993014097214,
-0.036327626556158066,
-0.019936930388212204,
-0.019627980887889862,
0.06579211354255676,
-0.007740079890936613,
0.0641612634062767,
0.08424773067235947,
0.06102679297327995,
-0.0351841002702713,
0.016440605744719505,
-0.03233606740832329,
0.019007643684744835,
0.0008... | |
4772f6b8-b250-5f3f-b7cc-cde8ef9a75af | /documentation/embeddings/mixedbread/ | Mixedbread | Next Steps | documentation | false | Mixedbread > Next Steps
- [Run `mxbai-embed-large-v1` with FastEmbed](/documentation/fastembed/), Qdrant's ONNX-based embedding library.
- Browse [Mixedbread's models on Hugging Face](https://huggingface.co/mixedbread-ai).
- [Filter search results](/documentation/search/filtering/) by payload fields.
- [Combine Mixedb... | [
0.06563044339418411,
-0.04517904669046402,
-0.02201094850897789,
-0.051701340824365616,
0.11067139357328415,
-0.03236781805753708,
0.06303765624761581,
-0.002490806160494685,
0.017421087250113487,
-0.0371256098151207,
0.03732605278491974,
0.018030118197202682,
0.05485648289322853,
-0.04722... |
47863bc8-b691-5eb2-afb0-acd13edb23cc | /articles/modern-sparse-neural-retrieval/ | Modern Sparse Neural Retrieval: From DeepCT to SPLADE++ | Sparse Neural Retrieval Evolution > Know Thine Tokenization | article | false | Modern Sparse Neural Retrieval: From DeepCT to SPLADE++ > Sparse Neural Retrieval Evolution > Know Thine Tokenization
To solve the problems of DeepImpact's architecture, the [`Term Independent Likelihood MoDEl (TILDEv2)`](https://arxiv.org/pdf/2108.08513) model generates
sparse encodings on a level of BERT’s represent... | [
0.067474864423275,
-0.04717697203159332,
-0.03666101023554802,
-0.034873925149440765,
0.06384929269552231,
-0.03995871543884277,
0.056899577379226685,
0.02418711595237255,
0.03970620036125183,
-0.02430718019604683,
0.02854490466415882,
0.03241899609565735,
0.057125650346279144,
-0.04927014... |
479211d8-e75f-51be-9897-770bfa749092 | /course/multi-vector-search/module-3/multi-stage-retrieval/ | Multi-Stage Retrieval with Universal Query API | Performance Characteristics | course | false | Multi-Stage Retrieval with Universal Query API > Performance Characteristics
Multi-stage retrieval's key advantage is **reducing the number of documents the multi-vector model scans**. Since late interaction performs full scans, limiting candidates dramatically improves performance.
**Direct late interaction**: 1M do... | [
0.030008098110556602,
-0.05755949392914772,
-0.0028582303784787655,
-0.010375777259469032,
0.06321419030427933,
-0.008899344131350517,
0.037123292684555054,
-0.011576374992728233,
0.10091139376163483,
-0.035722002387046814,
0.010379758663475513,
0.008085533045232296,
0.0761171355843544,
-0... |
4797aaec-50b1-52dd-89f5-e523bd019f52 | /documentation/manage-data/multitenancy/ | Multitenancy | Partition by Payload | documentation | true | Multitenancy > Partition by Payload
To partition data in a shared collection, add a payload field that identifies the tenant to each point. You can then filter by this field to ensure that each tenant only sees their own data.
This example uses `group_id` as the tenant field. Start by creating a keyword payload index... | [
0.02412264421582222,
0.005151625256985426,
-0.03258180990815163,
-0.022380784153938293,
0.06035786494612694,
-0.05049614608287811,
0.05111541226506233,
0.027835985645651817,
0.07536986470222473,
-0.033201150596141815,
0.02908763475716114,
0.05152259021997452,
0.041120629757642746,
-0.01165... |
479ed807-480f-5f3c-924f-05df45a961a9 | /documentation/private-cloud/changelog/ | Changelog | 1.9.1 (2025-11-14) | documentation | false | Changelog > 1.9.1 (2025-11-14)
| Component | Version |
|-------------------------|---------|
| qdrant-kubernetes-api | v1.20.0 |
| operator | 2.8.1 |
| qdrant-cluster-manager | v0.3.9 |
| qdrant-cluster-exporter | 1.7.2 |
* Automated storage class migration
* Support for max_paylo... | [
0.04666782543063164,
-0.028129655867815018,
-0.060365043580532074,
-0.028956199064850807,
0.057029590010643005,
-0.054518043994903564,
0.05069374665617943,
0.03405221924185753,
0.03853660449385643,
-0.040471743792295456,
0.03404068946838379,
0.025628767907619476,
0.040847472846508026,
-0.0... |
47a1494b-245a-5305-815c-4be1148e4808 | /course/essentials/day-3/hybrid-search-demo/ | Demo: Implementing a Hybrid Search System | Step 2: Create Collection with Named Vectors | course | true | Demo: Implementing a Hybrid Search System > Step 2: Create Collection with Named Vectors
For hybrid search, we need a collection that supports both sparse and dense vectors. Qdrant allows multiple named vectors per point:
```python
from qdrant_client import models
# Define the collection name
collection_name = "hybr... | [
0.06430771201848984,
-0.03938790038228035,
-0.06312507390975952,
-0.0378422848880291,
0.039997465908527374,
-0.046505339443683624,
0.06285841017961502,
0.04518579691648483,
0.08702611923217773,
-0.04297277703881264,
0.0327928252518177,
0.033216916024684906,
0.05925976112484932,
-0.02320251... |
47ab41ac-49b4-5c43-a1ae-62e20c1150e1 | /course/beginners/module-3/knowledge-check/ | Knowledge Check | course | false | Knowledge Check
Module 3
**Q: A shopper searches your catalog for `iPad Air`, and dense-only search returns `iPad Mini` first. Both are reasonable matches for the words, but the ranking is wrong. What would you add, and why would it fix this specific failure?**
Show answer
Add sparse (BM25) retrieval alongside dens... | [
0.05941852182149887,
0.003045549849048257,
-0.053619563579559326,
-0.05697805806994438,
0.06593426316976547,
-0.03902491182088852,
0.02248876914381981,
0.05077482387423515,
0.049061764031648636,
-0.03483687341213226,
0.04854455590248108,
0.04204116016626358,
0.027273673564195633,
-0.018607... | |
47bdd3d3-d6b6-5165-8fb4-b0f7fd144b36 | /documentation/fastembed/fastembed-postprocessing/ | Multi-Vector Postprocessing | Using MUVERA in FastEmbed > Hybrid Search: MUVERA Retrieval + ColBERT Reranking | documentation | true | Multi-Vector Postprocessing > Using MUVERA in FastEmbed > Hybrid Search: MUVERA Retrieval + ColBERT Reranking
Now let's perform a search using the hybrid approach. Qdrant supports [multi-stage
queries](/documentation/search/hybrid-queries/#multi-stage-queries) through the `prefetch` parameter, which lets us
combine ... | [
0.06689788401126862,
-0.04610941931605339,
-0.03149064630270004,
-0.049081236124038696,
0.07920300960540771,
-0.04309844225645065,
0.07897312194108963,
0.016856065019965172,
0.05778054520487785,
0.0031988206319510937,
0.01728210411965847,
0.04505864903330803,
0.055576156824827194,
-0.02973... |
47e05fcf-8345-507d-8584-4add37f7a948 | /documentation/tutorials-operations/secure-qdrant/ | Secure a Self-Hosted Qdrant Instance | documentation | false | Secure a Self-Hosted Qdrant Instance
| Time: 45 min | Level: Intermediate |
| --- | ----------- |
Qdrant offers a comprehensive set of [security and access control features](/documentation/security/) that enable you to protect your data and control access at multiple levels. By default, these features are enabled on ... | [
0.029237031936645508,
-0.049597181379795074,
-0.04922853782773018,
-0.04102487117052078,
0.04530107229948044,
-0.05135634168982506,
0.06273753941059113,
0.009852202609181404,
0.08390937000513077,
-0.014659353531897068,
-0.004917901009321213,
-0.011651949025690556,
0.06760101020336151,
-0.0... | |
47e5f389-6769-5cb5-b13c-48cc008047e8 | /documentation/migrate-to-qdrant/from-chroma/ | From Chroma | What You Need from Chroma | documentation | false | From Chroma > What You Need from Chroma
- **Chroma URL** — the HTTP endpoint of your Chroma server
- **Collection name** — the collection to migrate
- **Authentication** — API token or basic auth credentials, if configured | [
0.011135122738778591,
-0.042064305394887924,
-0.054377056658267975,
-0.050820209085941315,
0.06849628686904907,
-0.01726999133825302,
0.022447509691119194,
0.050438325852155685,
0.06704318523406982,
-0.009235532954335213,
0.032001618295907974,
-0.008615340106189251,
0.06799708306789398,
-0... |
47f55c8b-f621-529e-9d63-161c0e8781c3 | /articles/relevance-feedback/ | Relevance Feedback in Qdrant | Feedback-Based Scoring > Naive Formula | article | false | Relevance Feedback in Qdrant > Feedback-Based Scoring > Naive Formula
One of the options to express this behavior is through a weighted sum of signals, ensuring confidence and delta don't collapse into a single joint term by exponentiating one of them.
Applying the math of edge cases, we came up with this three-param... | [
0.03539881482720375,
-0.024665791541337967,
-0.04863979294896126,
-0.06919886916875839,
0.049599770456552505,
-0.023623516783118248,
0.021229997277259827,
0.041418496519327164,
0.0841374471783638,
-0.021201003342866898,
0.023953089490532875,
0.03384620323777199,
0.07995013147592545,
-0.025... |
47f6c987-1d46-5b69-a65c-adfe60bbff52 | /course/essentials/day-5/pitstop-project/ | Project: Building a Recommendation System | Setup | course | false | Project: Building a Recommendation System > Setup
### Prerequisites
* Qdrant Cloud cluster (URL + API key)
* Python 3.9+ (or Google Colab)
* Packages: `qdrant-client`, `fastembed`
### Models
- **Dense**: `sentence-transformers/all-MiniLM-L6-v2` (384-dim)
- **Sparse**: `prithivida/Splade_PP_en_v1` (SPLADE)
- **Multi... | [
0.02453174628317356,
-0.003002517856657505,
-0.04736696183681488,
-0.02966403402388096,
0.08573156595230103,
-0.04613498970866203,
0.07182367891073227,
0.02817518636584282,
0.06157988682389259,
-0.058134522289037704,
0.05661390349268913,
0.017590805888175964,
0.051418550312519073,
-0.03902... |
48192f64-faea-55e6-9885-b34155617b0c | /documentation/embeddings/upstage/ | Upstage | Setup | documentation | true | Upstage > Setup
Install the OpenAI SDK and the Qdrant client:
- Python: `pip install openai qdrant-client`
- TypeScript: `npm install openai @qdrant/js-client-rest`
Create an OpenAI client pointed at the Upstage API, the Qdrant client, and a collection sized for the model. These examples read your API key, which you... | [
0.041409604251384735,
-0.043932534754276276,
0.006098652724176645,
-0.032554611563682556,
0.06365294754505157,
-0.05144551023840904,
0.04291072115302086,
0.05156407877802849,
0.040666066110134125,
-0.03828469291329384,
0.06319107860326767,
-0.009555438533425331,
0.09101249277591705,
-0.053... |
481b2845-b19a-5214-b36c-e4d742d21e66 | /documentation/capacity-planning/ | Capacity Planning | documentation | false | Capacity Planning
Sizing a Qdrant cluster means estimating how much storage and memory your collections need and deciding how to distribute that load across nodes. The right setup depends on a few things:
- The number of vectors, their dimensions, and their datatype.
- Payload sizes and their payload indexes.
- Which... | [
0.006788983475416899,
-0.033536396920681,
-0.0664893239736557,
-0.05721314251422882,
0.056569650769233704,
-0.032878123223781586,
0.08389810472726822,
0.062416061758995056,
0.07982922345399857,
-0.05411534011363983,
0.03887401893734932,
-0.010931037366390228,
0.02353118732571602,
-0.012552... | |
481c1e31-24c0-5b09-90a5-e51419fcdbb0 | /documentation/private-cloud/api-reference/ | API Reference | qdrant.io/v1 > Resource Types > QdrantImage | documentation | false | API Reference > qdrant.io/v1 > Resource Types > QdrantImage
_Appears in:_
- [QdrantClusterSpec](#qdrantclusterspec)
| Field | Description | Default | Validation |
| --- | --- | --- | --- |
| `repository` _string_ | Repository specifies the repository of the Qdrant image.If not specified defaults the config of the ope... | [
0.04736580327153206,
-0.03967444598674774,
-0.017397599294781685,
-0.021632863208651543,
0.07929927855730057,
-0.05829870328307152,
0.07197222858667374,
0.07368931174278259,
0.02959074266254902,
-0.04140320047736168,
0.04984205216169357,
0.004739548545330763,
0.047310248017311096,
-0.02471... |
4849d825-8a98-50b8-a8ec-805d979a2460 | /course/essentials/day-1/chunking-strategies/ | Text Chunking Strategies | Chunking Strategies: The Shape Matters | course | false | Text Chunking Strategies > Chunking Strategies: The Shape Matters
How you chunk affects what your embeddings capture, what your retriever can surface, and what your LLM can reason over. There's no one-size-fits-all approach. Let's explore the options: | [
0.0192585289478302,
-0.03978357091546059,
-0.06572882831096649,
-0.08364927768707275,
0.03837963193655014,
-0.030113182961940765,
0.07650527358055115,
0.035356320440769196,
0.05614038556814194,
0.0034247846342623234,
0.031182004138827324,
-0.027747303247451782,
0.0663599967956543,
-0.01546... |
485d3a17-5a76-59dc-8343-6686fa5e2ed4 | /articles/predicting-weak-retrieval/ | Predicting Weak Retrieval Without an LLM | Cheap Signals | article | false | Predicting Weak Retrieval Without an LLM > Cheap Signals
A **signal** is a number computed from the result that predicts weak evidence. Two criteria:
1. It separates good retrievals from weak ones on labeled data.
2. It is cheap enough to run on every query.
"Cheap" rules out the obvious move: asking an LLM "is this... | [
0.042058851569890976,
-0.0523800253868103,
-0.0691799521446228,
-0.07598613947629929,
0.04862847924232483,
-0.03188422694802284,
0.050480008125305176,
0.024970833212137222,
0.07321149855852127,
-0.03844768926501274,
0.021885115653276443,
0.018066270276904106,
0.05031042546033859,
-0.004302... |
486ad5fe-4b8e-5aea-a102-9e5d6926eb8f | /articles/metric-learning-tips/ | Metric Learning Tips & Tricks | How to train object matching model with no labeled data and use it in production | article | false | Metric Learning Tips & Tricks > How to train object matching model with no labeled data and use it in production
In 2021, most machine-learning-related business cases were solved as classification problems.
Classification algorithms are so well studied in practice that even if the original problem is not directly a cl... | [
0.04572538286447525,
0.004382634535431862,
-0.06862588971853256,
-0.048405323177576065,
0.05945271998643875,
-0.05087622255086899,
0.050880830734968185,
0.08290635049343109,
0.04849376156926155,
-0.008108374662697315,
0.006442084442824125,
0.04292762279510498,
0.086643747985363,
-0.0530669... |
486b84ae-11d4-5384-9eda-dac097bf4bcf | /documentation/send-data/ | Send Data to Qdrant | documentation | false | Send Data to Qdrant
## How to Send Your Data to a Qdrant Cluster
The following examples show you some of the many ways you can send data to a Qdrant cluster from different sources.
If you want to migrate data from another Qdrant instance or vector database like Pinecone, Weaviate or Milvus see our [Migration Guide](... | [
0.04962494596838951,
-0.047986604273319244,
-0.039377547800540924,
-0.036215607076883316,
0.05198347568511963,
-0.0209149569272995,
0.04488709196448326,
0.07193373888731003,
-0.0026672370731830597,
-0.013656959868967533,
-0.0037690524477511644,
0.03313824161887169,
0.012182177044451237,
-0... | |
487446d6-903e-584a-92ee-c72fdf283ab4 | /documentation/production-operations/predictable-search-latency/ | Configure Qdrant's Optimizer for Predictable Search Latency | Deferred Indexing Means Optimizing All at Once | documentation | false | Configure Qdrant's Optimizer for Predictable Search Latency > Deferred Indexing Means Optimizing All at Once
Don't defer indexing as a way to dodge read-write contention during upload unless you also enable `prevent_unoptimized` once you turn indexing back on. Flipping indexing on after the fact reopens the entire bac... | [
0.018276700749993324,
-0.03832947090268135,
-0.05527662858366966,
-0.006986966356635094,
0.06485100090503693,
-0.05345117673277855,
0.03830697759985924,
0.019466770812869072,
0.10930577665567398,
-0.02736629545688629,
0.03200042247772217,
-0.004048266913741827,
0.058700982481241226,
-0.049... |
4897301a-1f15-522e-82f8-a5b1563c1138 | /documentation/search/search-relevance/ | Search Relevance | Maximal Marginal Relevance (MMR) | documentation | true | Search Relevance > Maximal Marginal Relevance (MMR)
_Available as of v1.15.0_
[Maximal Marginal Relevance (MMR)](https://www.cs.cmu.edu/~jgc/publication/The_Use_MMR_Diversity_Based_LTMIR_1998.pdf) is an algorithm to improve the diversity of the results. It excels when the dataset has many redundant or very similar po... | [
0.05945911258459091,
-0.06401979178190231,
-0.052606385201215744,
-0.03198189288377762,
0.06920099258422852,
-0.0065175569616258144,
0.06339658051729202,
0.011740891262888908,
0.06817599385976791,
-0.030030306428670883,
0.03377387672662735,
-0.001884644734673202,
0.06120528280735016,
0.005... |
489c3f34-276c-5885-843c-c07eee91b20a | /documentation/data-synchronization/with-postgres/ | Keeping Postgres and Qdrant in Sync | Tier 1: Application-Level Dual-Write > The Code | documentation | true | Keeping Postgres and Qdrant in Sync > Tier 1: Application-Level Dual-Write > The Code
The route handler is exactly what you'd expect: one write after the other, with error handling around the Qdrant call:
```py
@router.post("/products", response_model=ProductResponse, status_code=201)
async def create_product(product... | [
0.0015858800616115332,
-0.05204162001609802,
-0.021955858916044235,
-0.010563403367996216,
0.014163821004331112,
-0.008902858942747116,
0.06565918773412704,
0.04056405648589134,
0.054249513894319534,
0.035287875682115555,
0.005724810063838959,
0.03515550494194031,
0.024684332311153412,
-0.... |
48a5f7b9-aa29-5b90-8a90-de2e8d343fdd | /documentation/tutorials-operations/gpu-accelerated-hnsw-indexing/ | GPU-Accelerated HNSW Indexing | Setting Up a GPU-Powered Cluster | documentation | true | GPU-Accelerated HNSW Indexing > Setting Up a GPU-Powered Cluster
You can set up a GPU-powered cluster on Qdrant Cloud either through the [dedicated UI](/documentation/cloud/create-cluster/), or, as this tutorial does, with the [`qcloud` CLI](/documentation/cloud-cli/), a command-line application for managing Qdrant Cl... | [
-0.020300844684243202,
-0.031063620001077652,
-0.059427469968795776,
-0.015919135883450508,
0.07580956816673279,
-0.02364855259656906,
0.048287589102983475,
0.056931253522634506,
0.06710336357355118,
-0.06482473015785217,
0.03612450510263443,
0.014704895205795765,
0.05400597304105759,
-0.0... |
48a80e63-7a71-566e-9198-0b928dd8f84d | /course/essentials/day-6/final-project/ | Final Project: Production-Ready Documentation Search Engine | Your Mission | course | false | Final Project: Production-Ready Documentation Search Engine > Your Mission
Day 6
It's time to synthesize everything you've learned into a portfolio-ready application. You'll build a sophisticated documentation search engine that shows hybrid retrieval, multivector reranking, and production-quality evaluation.
Your s... | [
0.03377353772521019,
-0.02944249100983143,
-0.04680808261036873,
-0.033860672265291214,
0.08245071768760681,
-0.06599193066358566,
0.04332897812128067,
0.026404865086078644,
0.07878086715936661,
-0.019412947818636894,
0.009274645708501339,
0.04543929547071457,
0.08956851810216904,
-0.05612... |
48aff3fe-dd67-5781-8e0c-24677ab738e5 | /documentation/tutorials-operations/time-based-sharding/ | Time-Based Sharding | Conclusion | documentation | false | Time-Based Sharding > Conclusion
Time-based sharding is a powerful technique for managing large, time-series datasets in Qdrant. By routing data to different shards based on timestamps, you can efficiently store and query recent data while easily pruning older data without impacting performance. This approach is ideal... | [
-0.01146705076098442,
-0.03846970200538635,
-0.06454196572303772,
-0.08451782912015915,
-0.010055935941636562,
-0.045340657234191895,
0.0752304270863533,
0.022403132170438766,
0.08528193086385727,
-0.004660333506762981,
0.06516403704881668,
-0.029972780495882034,
0.04577263817191124,
-0.01... |
48b0757e-0f59-5362-858a-5261038d7843 | /documentation/quickstart/ | Local Quickstart | documentation | false | Local Quickstart
In this short example, you will use the Python Client to create a Collection, load data into it and run a basic search query.
Before you start, please make sure Docker is installed and running on your system. | [
-0.004862935282289982,
-0.07042786478996277,
-0.02984318695962429,
-0.010248427279293537,
0.06801626831293106,
-0.055077988654375076,
0.029195336624979973,
0.013828211463987827,
0.09858065843582153,
-0.011334912851452827,
0.02620709128677845,
0.03713621199131012,
0.05584319308400154,
-0.03... | |
48c76bfb-a10e-5c02-8f2d-7cbd636a0e22 | /documentation/private-cloud/api-reference/ | API Reference | qdrant.io/v1 > Resource Types > EntityResult | documentation | false | API Reference > qdrant.io/v1 > Resource Types > EntityResult
_Underlying type:_ _string_
EntityResult is the last result from the invocation to a manager
_Appears in:_
- [QdrantEntityStatusResult](#qdrantentitystatusresult)
| Field | Description |
| --- | --- |
| `Ok` | |
| `Pending` | |
| `Error` | | | [
0.04936308041214943,
-0.05706805735826492,
-0.02946881391108036,
-0.06666585057973862,
0.06222420185804367,
-0.01869385316967964,
0.04895006865262985,
0.045948974788188934,
0.0904822126030922,
-0.0461408831179142,
0.00903353188186884,
0.008675770834088326,
0.057500410825014114,
-0.01391485... |
48ddbde8-39b6-55d2-9ed2-5a24533cfd22 | /documentation/platforms/n8n/ | N8N | Setting up the node | documentation | false | N8N > Setting up the node
- Select and install the official Qdrant node from the list of nodes in your workflow editor.

- Once installed, you can create a connection to Qdrant using your [credentials](/documentation/cloud/authentication/).
. You can do this by creating a `ServiceMonitor` resource in the host Kubernetes cluster.
```yaml
apiVersion: monitoring.coreo... | [
0.03864510729908943,
-0.024901071563363075,
-0.028514567762613297,
0.023631449788808823,
0.06794678419828415,
-0.03809327632188797,
0.09411437064409256,
0.06064390018582344,
0.033467940986156464,
-0.027902798727154732,
0.05302789807319641,
0.015953101217746735,
0.07834065705537796,
-0.0211... |
493eac40-0711-55ed-817e-8fba004e5399 | /documentation/search/text-search/full-text-search/ | Full-Text Search | BM25 | documentation | false | Full-Text Search > BM25
[BM25](https://en.wikipedia.org/wiki/Okapi_BM25) (Best Matching 25) is a popular ranking algorithm that takes a probabilistic approach to score calculation. For each search term, BM25 considers several statistics about the term and the document to calculate a relevance score:
- Term frequency (... | [
0.020084021613001823,
-0.023604007437825203,
-0.03911289572715759,
-0.06495301425457001,
0.0370725654065609,
-0.053885459899902344,
0.07056446373462677,
0.04481682553887367,
0.07300406694412231,
-0.015292836353182793,
0.040240030735731125,
-0.00834864005446434,
0.03407573699951172,
-0.0386... |
494dad2e-d7a2-5a5f-b226-5cc97765836c | /documentation/data-management/confluent/ | Confluent Kafka | Producing Messages | documentation | false | Confluent Kafka > Producing Messages
You can now produce messages for the configured topic, and they'll be written into the configured Qdrant instance.
 | [
-0.009772298857569695,
-0.022145159542560577,
-0.03794574365019798,
-0.04425957053899765,
0.06568890064954758,
-0.0398004911839962,
0.03063238225877285,
0.0767553299665451,
0.05216222256422043,
-0.01744846999645233,
0.016115562990307808,
-0.019902709871530533,
0.06603085994720459,
-0.05289... |
4956d292-f93e-5687-a2a7-becc19aea25a | /documentation/search-tuning/hybrid-search/ | Hybrid Search in Qdrant | Dense and Sparse Retrieval Miss Different Things | documentation | false | Hybrid Search in Qdrant > Dense and Sparse Retrieval Miss Different Things
Learned sparse models change what the sparse side matches. [miniCOIL](/documentation/fastembed/fastembed-minicoil/) keeps BM25's term matching but reweights each term by context, so "bat" in a sports listing and "bat" in a wildlife guide no lon... | [
0.03256108611822128,
-0.033548109233379364,
-0.022576866671442986,
-0.06422745436429977,
0.059934791177511215,
-0.05435188114643097,
0.054620806127786636,
0.03597130626440048,
0.024750249460339546,
-0.014417218044400215,
0.05504491925239563,
0.04732052609324455,
0.03596268594264984,
0.0215... |
496af4fc-f77e-5115-ad4f-7067ed92df35 | /course/essentials/day-3/pitstop-project/ | Project: Building a Hybrid Search Engine | Your Mission | course | false | Project: Building a Hybrid Search Engine > Your Mission
Create a production-ready hybrid search system that leverages both dense and sparse vectors to deliver superior search results. You'll implement the complete hybrid pipeline and compare its performance against single-vector approaches.
**Estimated Time:** 75 min... | [
-0.015631329268217087,
-0.03808020055294037,
-0.05018652230501175,
-0.020342322066426277,
0.07515925914049149,
-0.04036285728216171,
0.05291493609547615,
0.02261107973754406,
0.09079524874687195,
-0.024272959679365158,
0.025563739240169525,
0.0164866354316473,
0.0711304172873497,
-0.025408... |
4999921d-5866-5fcd-b00a-c75a4afe83e2 | /documentation/frameworks/autogen/ | AutoGen | documentation | true | AutoGen
[AutoGen](https://github.com/microsoft/autogen/tree/0.2) is an open-source programming framework for building AI agents and facilitating cooperation among multiple agents to solve tasks.
- Multi-agent conversations: AutoGen agents can communicate with each other to solve tasks. This allows for more complex a... | [
-0.010022975504398346,
-0.05729077011346817,
-0.051596302539110184,
-0.05132928863167763,
0.10669224709272385,
-0.0438707172870636,
0.05370289459824562,
0.029670612886548042,
0.0359112024307251,
-0.06217615678906441,
0.06993990391492844,
0.010324999690055847,
0.04807421565055847,
-0.032558... | |
49a07d48-2496-57e8-bcc9-7b13bc6814bc | /articles/search-feedback-loop/ | Relevance Feedback in Information Retrieval | Similarity Scoring | article | false | Relevance Feedback in Information Retrieval > Similarity Scoring
The biggest limitation here is that these reranker-based methods cannot retrieve relevant documents beyond those returned in the initial search, and using rerankers on thousands of documents in production is a no-go – it’s too expensive.
Ideally, to avoi... | [
0.03395623341202736,
-0.04069209098815918,
-0.06380770355463028,
-0.08837169408798218,
0.05696122720837593,
-0.03781233727931976,
0.031579166650772095,
0.016039054840803146,
0.07152089476585388,
0.007225210778415203,
0.03276205435395241,
0.03451458364725113,
0.09505748748779297,
0.00583792... |
49d76262-6802-5a89-b2fb-e699d0fdb487 | /documentation/manage-data/bulk-upload/ | Bulk Upload | Upload Directly to Disk | documentation | false | Bulk Upload > Upload Directly to Disk
When the vectors you upload do not all fit in RAM, you likely want to move them to the
[`cold` memory tier](/documentation/ops-configuration/memory-tiers/) directly.
During [collection
creation](/documentation/manage-data/collections/#create-a-collection),
you can set the `memory... | [
0.028854975476861,
-0.027689959853887558,
-0.03846233710646629,
-0.04793523624539375,
0.06412269920110703,
-0.01474668551236391,
0.06352577358484268,
0.05357886478304863,
0.08760668337345123,
-0.011716833338141441,
-0.022128259763121605,
0.009023456834256649,
0.04446903616189957,
-0.028576... |
49e508ef-6410-5d05-a269-e64f1385412b | /course/essentials/day-6/final-project/ | Final Project: Production-Ready Documentation Search Engine | Setup | course | true | Final Project: Production-Ready Documentation Search Engine > Setup
### Prerequisites
* Qdrant Cloud cluster (URL + API key)
* Python 3.9+ (or Google Colab)
* Packages: `qdrant-client`, `numpy`
### Models
- **Dense**: `BAAI/bge-small-en-v1.5` (384-dim) or `BAAI/bge-base-en-v1.5` (768-dim)
- **Sparse**: BM25/TF-IDF ... | [
0.016480952501296997,
-0.020985065028071404,
-0.05142471566796303,
-0.05155531316995621,
0.07089512795209885,
-0.046261727809906006,
0.04846162721514702,
0.022552594542503357,
0.06780178844928741,
-0.06661558151245117,
0.04381825402379036,
0.014944817870855331,
0.04476277902722359,
-0.0277... |
49e5b90e-a88d-5efd-ae86-78714bf007a6 | /documentation/platforms/keboola/ | Keboola | documentation | false | Keboola
[Keboola](https://www.keboola.com/) is a data operations platform that integrates data engineering, analytics, and machine learning tools into a single environment. It helps businesses unify their data sources, transform data, and deploy ML models to production.
## Prerequisites
1. A Qdrant instance to conne... | [
0.011245392262935638,
-0.047762658447027206,
-0.07968151569366455,
-0.047934968024492264,
0.0683990865945816,
0.0070025380700826645,
0.08658519387245178,
0.018543867394328117,
0.06011832132935524,
-0.02634868584573269,
0.00009425447206012905,
-0.004404670093208551,
0.03840288147330284,
-0.... | |
49f013cb-bb86-5ad9-971f-7ed98b133320 | /documentation/search/search-relevance/ | Search Relevance | Score Boosting > Decay Functions | documentation | false | Search Relevance > Score Boosting > Decay Functions
| Decay Function | Range | Formula |
|----------------|-------|-------|---------|
| **`lin_decay`** | `[0, 1]` | $\text{lin_decay}(x) = \max\left(0,\ -\frac{(1-m_{idpoint})}{s_{cale}}\cdot {abs}(x-t_{arget})+1\right)$ |
| **`exp_decay`** | `(0, 1]` | $\text{exp_decay... | [
0.030606046319007874,
-0.007368132937699556,
-0.018610013648867607,
-0.007331040687859058,
0.04292244464159012,
-0.021992318332195282,
0.03343808650970459,
0.015666786581277847,
0.061032723635435104,
-0.019302958622574806,
0.028230711817741394,
0.014030416496098042,
0.03575342521071434,
0.... |
4a06c125-3a39-5998-a28f-78070a851870 | /articles/muvera-embeddings/ | MUVERA: Making Multivectors More Performant | Practical considerations > Impact on search performance | article | false | MUVERA: Making Multivectors More Performant > Practical considerations > Impact on search performance
To evaluate the effectiveness of MUVERA embeddings, we benchmarked three different approaches on the BeIR nfcorpus
dataset using the ColBERTv2 model. The MUVERA configuration used the following parameters: `k_sim=5`,... | [
0.044269245117902756,
-0.039839573204517365,
-0.06584532558917999,
-0.03673454746603966,
0.06922096759080887,
-0.013712328858673573,
0.0808921828866005,
0.03900853917002678,
0.06264596432447433,
0.01954581029713154,
0.0036293736193329096,
0.02930367738008499,
0.033268701285123825,
-0.03754... |
4a13594b-35d1-5031-884f-3728c5f99dad | /course/essentials/day-7/haystack/ | Integrating with Haystack | Haystack Movie Recommendation Assistant > Implementation Workflow | course | false | Integrating with Haystack > Haystack Movie Recommendation Assistant > Implementation Workflow
The movie recommendation system follows these key steps:
1. **Data Preparation**:
- Convert movie data into Haystack documents with rich metadata
- Structure information including title, genre, rating, year, language,... | [
0.031919289380311966,
-0.05128486827015877,
-0.07668004930019379,
-0.013237950392067432,
0.07332560420036316,
-0.03535871207714081,
0.03002835251390934,
0.02594071812927723,
0.06358867138624191,
0.009464630857110023,
0.0425262413918972,
-0.0037123896181583405,
0.04430392012000084,
-0.05287... |
4a23ec60-fed5-53f1-9d98-a0c31146ea51 | /documentation/production-operations/managed-cloud-prometheus/ | Managed Cloud Prometheus Monitoring | Step 4: Import Qdrant Dashboard | documentation | false | Managed Cloud Prometheus Monitoring > Step 4: Import Qdrant Dashboard
Qdrant Cloud offers an example Grafana dashboard in the [Qdrant GitHub repository](https://github.com/qdrant/qdrant-cloud-grafana-dashboard). This comes with built-in views and graphs to help you get started monitoring your Qdrant clusters.
To impo... | [
0.01669652946293354,
-0.045212965458631516,
-0.046586960554122925,
-0.02255900576710701,
0.06007971987128258,
-0.024390365928411484,
0.06003409996628761,
0.06304392218589783,
0.05034148693084717,
-0.022303210571408272,
0.0041007897816598415,
0.026522859930992126,
0.056012049317359924,
-0.0... |
4a27e9c1-f936-5991-a4f9-c2ea09af8a44 | /documentation/hybrid-cloud/hybrid-cloud-setup/ | Setup Hybrid Cloud | Advanced configuration > Mirroring images and charts > Required artifacts | documentation | false | Setup Hybrid Cloud > Advanced configuration > Mirroring images and charts > Required artifacts
Container images:
- `registry.cloud.qdrant.io/qdrant/qdrant`
- `registry.cloud.qdrant.io/qdrant/qdrant-cloud-agent`
- `registry.cloud.qdrant.io/qdrant/operator`
- `registry.cloud.qdrant.io/qdrant/cluster-manager`
- `registr... | [
0.022357627749443054,
-0.01721908152103424,
-0.027700969949364662,
-0.04480081796646118,
0.05305175110697746,
-0.04147736355662346,
0.036867570132017136,
0.0674901232123375,
0.05250823125243187,
-0.06159697473049164,
0.046897560358047485,
-0.008892182260751724,
0.07755474746227264,
-0.0385... |
4a31019f-17b1-5eea-9137-3f8ffdbf636b | /documentation/production-operations/predictable-search-latency/ | Configure Qdrant's Optimizer for Predictable Search Latency | Continuous Indexing Pays Off (After a Recovery Window) | documentation | false | Configure Qdrant's Optimizer for Predictable Search Latency > Continuous Indexing Pays Off (After a Recovery Window)
We advise to leave continuous indexing on unless permanently slower search is acceptable. It costs a temporary recovery window right after ingestion, while the collection catches up on building the HNSW... | [
0.011026985943317413,
-0.049703191965818405,
-0.04254446178674698,
-0.004502277355641127,
0.05199478566646576,
-0.05725941061973572,
0.024198686704039574,
0.018482426181435585,
0.09070052951574326,
-0.04216236621141434,
0.05649295821785927,
0.00017719878815114498,
0.06256178766489029,
-0.0... |
4a49e915-b1dd-5445-8280-24702bbe213b | /documentation/tutorials-search-engineering/using-multivector-representations/ | Multivectors and Late Interaction | Why Token-level Vectors are Useful | documentation | false | Multivectors and Late Interaction > Why Token-level Vectors are Useful
With token-level vectors, models like ColBERT can match specific query tokens to the most relevant parts of a document, enabling high-accuracy retrieval through Late Interaction.
In late interaction, each document is converted into multiple token-... | [
0.025607001036405563,
-0.04309259355068207,
-0.03194079175591469,
-0.05985201895236969,
0.048427872359752655,
-0.047430846840143204,
0.06343663483858109,
0.03842535242438316,
0.06086108461022377,
-0.018880845978856087,
0.015300078317523003,
0.013773437589406967,
0.04218996316194534,
-0.021... |
4a4e8222-e1f1-5c00-b960-3ee28be682dc | /documentation/cloud-rbac/user-management/ | User Management | Making a User the Owner of an Account | documentation | false | User Management > Making a User the Owner of an Account
Only account owners are allowed to transfer ownership of an account, this can be done via the **User Management** page. There can only be one account owner per account.
 | [
0.00390372471883893,
-0.03353986144065857,
-0.07353631407022476,
-0.03497066721320152,
0.03594374656677246,
-0.007967443205416203,
-0.022208258509635925,
0.047117795795202255,
0.07270824909210205,
-0.030857520177960396,
0.006271349266171455,
0.03958936408162117,
0.11311265081167221,
-0.069... |
4a5b17fe-ab40-5e80-8dd0-51d167ab0c00 | /documentation/tutorials-basics/generate-embeddings-fastembed/ | FastEmbed: Qdrant's Efficient Python Library for Embedding Generation | Generate Embeddings | documentation | true | FastEmbed: Qdrant's Efficient Python Library for Embedding Generation > Generate Embeddings
Create a `TextEmbedding` model and embed a list of documents:
```python
from typing import List
import numpy as np
from fastembed import TextEmbedding
documents: List[str] = [
"Hello, World!",
"fastembed is supported ... | [
0.03436785936355591,
-0.02566566877067089,
-0.018949149176478386,
-0.07078368216753006,
0.0759320929646492,
-0.05038926377892494,
0.05278529226779938,
0.06430989503860474,
0.012707281857728958,
-0.00837929267436266,
0.04960669204592705,
0.048602037131786346,
0.04166776314377785,
-0.0514501... |
4a6d8524-39c4-5114-b240-5e3988538ef0 | /documentation/tutorials-operations/large-scale-search/ | Large-Scale Search | documentation | false | Large-Scale Search
| Time: 2 days | Level: Advanced | | |
|--------------|-----------------|--|----|
In this tutorial, we will describe an approach to upload, index, and search a large volume of data cost-efficiently,
on an example of the real-world dataset [LAION-400M](https://laion.ai/blog/laion-400-open-datas... | [
0.01544683612883091,
-0.03427104651927948,
-0.05719392001628876,
-0.02027907595038414,
0.07801707088947296,
-0.03477777913212776,
0.04789246618747711,
0.014355449937283993,
0.07503969222307205,
-0.020450612530112267,
0.02065739966928959,
0.022551801055669785,
0.07185516506433487,
-0.063152... | |
4a74666a-69bb-5ba0-b041-9f15436e824d | /course/essentials/day-5/universal-query-demo/ | Demo: Universal Query for Hybrid Retrieval | Step 2: The Universal Query in Action > Display Results | course | true | Demo: Universal Query for Hybrid Retrieval > Step 2: The Universal Query in Action > Display Results
```python
# Display results
print("Top Research Papers:")
for i, hit in enumerate(response.points or [], 1):
paper = hit.payload
print(f"{i}. {paper['title']}")
print(f" Authors: {', '.join(paper['authors... | [
0.020575731992721558,
-0.025976162403821945,
-0.06307286769151688,
-0.022190261632204056,
0.04069886356592178,
-0.01933245360851288,
0.029503148049116135,
0.047493256628513336,
0.0786496251821518,
-0.027704110369086266,
0.04428254812955856,
0.03703083097934723,
0.10875225812196732,
-0.0000... |
4a7e3871-ea25-5a31-8e2f-88d10ed89bef | /course/beginners/ | Qdrant Beginner Course | Syllabus | course | false | Qdrant Beginner Course > Syllabus
- title: "Module 0: Setting Up Dependencies"
content: |
- Qdrant Cloud Setup
- Implementing a Basic Vector Search
→ Start Module 0
- title: "Module 1: Let's Understand Search"
content: |
- The Problem: Why Traditional Search Struggles
- How Traditional Search Imp... | [
0.055461227893829346,
-0.03458522632718086,
-0.06011650711297989,
-0.011997037567198277,
0.06639552861452103,
-0.035284630954265594,
0.07499923557043076,
0.06426079571247101,
0.0806255042552948,
-0.04149948060512543,
0.03209151327610016,
0.025357535108923912,
0.04701836779713631,
-0.030109... |
4a902cc5-4ea4-5a83-82b1-95e1b287b0b1 | /course/multi-vector-search/module-0/installing-dependencies/ | Installing Dependencies | Next Steps | course | false | Installing Dependencies > Next Steps
With your Python environment configured and dependencies installed, you're ready to dive into Module 1, where we'll explore the fundamentals of multi-vector search and understand how it differs from traditional single-vector approaches. | [
0.024028198793530464,
-0.078656405210495,
-0.020749369636178017,
-0.02918143942952156,
0.044837646186351776,
-0.03408339247107506,
0.02411390095949173,
0.05755579471588135,
0.08645639568567276,
-0.019709782674908638,
0.028517287224531174,
0.057475414127111435,
0.07262547314167023,
-0.02839... |
4a9a80bf-67fa-55ec-8ac6-c1344adcb6fc | /course/essentials/day-6/congratulations/ | Course Completion and Next Steps | Production Readiness | course | false | Course Completion and Next Steps > Production Readiness
Your final project demonstrates several production-critical capabilities:
**Hybrid Architecture**: You've implemented the state-of-the-art approach that combines dense vectors for semantic understanding, sparse vectors for keyword precision, and multivectors for... | [
0.004296984989196062,
-0.025574255734682083,
-0.035998910665512085,
-0.035647355020046234,
0.08674594759941101,
-0.04951312020421028,
0.06104748323559761,
0.013662638142704964,
0.08247905224561691,
-0.042065978050231934,
0.01937546394765377,
0.014018089510500431,
0.06456980854272842,
-0.03... |
4aab4b54-a508-5dc7-bc70-619e97a1b6ec | /course/essentials/day-0/building-simple-vector-search/ | Implementing a Basic Vector Search | Step 3: Connect to Qdrant Cloud | course | true | Implementing a Basic Vector Search > Step 3: Connect to Qdrant Cloud
To connect to Qdrant Cloud, you need your cluster URL and API key from your Qdrant Cloud dashboard. Replace with your actual credentials:
```python
import os
client = QdrantClient(url=os.getenv("QDRANT_URL"), api_key=os.getenv("QDRANT_API_KEY"))
#... | [
0.029912350699305534,
-0.08181735128164291,
-0.03123589977622032,
-0.026890814304351807,
0.05397767573595047,
-0.04781992360949516,
0.0740738958120346,
0.040559593588113785,
0.05759488418698311,
-0.04430215805768967,
-0.0034799324348568916,
0.02037881873548031,
0.05544983968138695,
-0.0250... |
4ab1fc5b-645b-5f5e-b047-9ccfca740619 | /course/multi-vector-search/module-3/evaluating-pipelines/ | Evaluating Search Pipelines | Summary | course | false | Evaluating Search Pipelines > Summary
Evaluating multi-vector search pipelines requires:
1. **Ground truth data** (qrels) that defines what "correct" retrieval means
2. **A unified collection architecture** that stores all vector representations together
3. **Representative pipeline configurations** that cover the ke... | [
0.022578757256269455,
-0.050204675644636154,
-0.050334956496953964,
-0.03233765810728073,
0.03994406387209892,
-0.02689964510500431,
0.06952480971813202,
0.02906442992389202,
0.055070456117391586,
-0.015942158177495003,
-0.013006569817662239,
0.03318445384502411,
0.07564136385917664,
-0.04... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.