mirror of
https://github.com/qdrant/landing_page.git
synced 2026-10-01 00:48:32 +02:00
Add tutorial visuals
This commit is contained in:
+6
-4
@@ -14,7 +14,7 @@ Companies want their data to be kept and processed within specific geographical
|
|||||||
|
|
||||||
[//]: # (TODO: add link to Qdrant Hybrid Cloud above)
|
[//]: # (TODO: add link to Qdrant Hybrid Cloud above)
|
||||||
|
|
||||||
TODO: add a system diagram with all the components
|

|
||||||
|
|
||||||
## Components
|
## Components
|
||||||
|
|
||||||
@@ -25,9 +25,7 @@ Directory.
|
|||||||
|
|
||||||
> **Note:** In this tutorial, we are going to build a solid foundation for such a system. However, it is up to your organization's setup to implement the entire solution.
|
> **Note:** In this tutorial, we are going to build a solid foundation for such a system. However, it is up to your organization's setup to implement the entire solution.
|
||||||
|
|
||||||
[//]: # (TODO: upload the dataset to GCP and link it below)
|
- **Dataset** - a collection of documents, using different formats, such as PDF or DOCx, scraped from internet
|
||||||
|
|
||||||
- **Dataset** - a collection of documents, using different formats, such as PDF or DOCx
|
|
||||||
- **Asymmetric semantic embeddings** - [Aleph Alpha embedding](https://docs.aleph-alpha.com/api/semantic-embed/) to
|
- **Asymmetric semantic embeddings** - [Aleph Alpha embedding](https://docs.aleph-alpha.com/api/semantic-embed/) to
|
||||||
convert the queries and the documents into vectors
|
convert the queries and the documents into vectors
|
||||||
- **Large Language Model** - the [Luminous-extended-control
|
- **Large Language Model** - the [Luminous-extended-control
|
||||||
@@ -155,6 +153,10 @@ documents = {
|
|||||||
}
|
}
|
||||||
```
|
```
|
||||||
|
|
||||||
|
This is how the documents might look like:
|
||||||
|
|
||||||
|

|
||||||
|
|
||||||
Each has to be split into chunks first; there is no silver bullet. Our chunking algorithm will be simple and based on
|
Each has to be split into chunks first; there is no silver bullet. Our chunking algorithm will be simple and based on
|
||||||
recursive splitting, with the maximum chunk size of 500 characters and the overlap of 100 characters.
|
recursive splitting, with the maximum chunk size of 500 characters and the overlap of 100 characters.
|
||||||
|
|
||||||
|
|||||||
BIN
Binary file not shown.
|
After Width: | Height: | Size: 99 KiB |
BIN
Binary file not shown.
|
After Width: | Height: | Size: 163 KiB |
Reference in New Issue
Block a user