update text and image

This commit is contained in:
davidmyriel
2024-10-05 08:40:13 -07:00
parent bf6e9e6366
commit 310982c950
2 changed files with 5 additions and 1 deletions
+5 -1
View File
@@ -39,6 +39,10 @@ In data exploration, tasks like [**clustering**](https://en.wikipedia.org/wiki/D
You can use this API to compute a **sparse matrix of distances** that is optimized for large datasets. Then, you can filter through the retrieved data to find the exact vector relationships that matter. You can use this API to compute a **sparse matrix of distances** that is optimized for large datasets. Then, you can filter through the retrieved data to find the exact vector relationships that matter.
In terms of endpoints, we offer two different formats to show results:
- **Pairs** are simple, intutitive and ideal for graph representation.
- **Offsets** are more comples, but also native when defining CSR sparse matrices.
### Configuration - Pairs ### Configuration - Pairs
Use the `pairs` endpoint to compare 10 random point pairs from your dataset: Use the `pairs` endpoint to compare 10 random point pairs from your dataset:
@@ -81,7 +85,7 @@ Qdrant will list a sparse matrix of distances **between the closest pairs**:
### Configuration - Offsets ### Configuration - Offsets
The `offsets` endpoint is another method of calculating the distance between points: The `offsets` endpoint offer another format of showing the distance between points:
```http ```http
POST /collections/{collection_name}/points/search/matrix/offsets POST /collections/{collection_name}/points/search/matrix/offsets
Binary file not shown.

Before

Width:  |  Height:  |  Size: 1.0 MiB

After

Width:  |  Height:  |  Size: 872 KiB