Editing
Embeddings and Vector Databases
(section)
Jump to navigation
Jump to search
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== <span style="color: #FFFFFF;">Remembering</span> == * '''Embedding''' β A dense vector of real numbers representing the meaning of a piece of data. Similar items have vectors that are close together in the embedding space. * '''Embedding model''' β A neural network trained to produce embeddings. Examples: text-embedding-3-small (OpenAI), BGE-M3 (BAAI), all-MiniLM-L6-v2 (Sentence Transformers). * '''Dimensionality''' β The number of values in an embedding vector. Common sizes: 384, 768, 1536, 3072. Higher dimensions can capture more nuance but require more storage and compute. * '''Semantic similarity''' β The degree to which two items mean the same thing, encoded as the geometric distance between their embeddings. * '''Cosine similarity''' β The most common similarity metric for embeddings; measures the angle between two vectors. Values range from -1 (opposite) to 1 (identical). * '''Dot product''' β An alternative similarity metric; equivalent to cosine similarity when vectors are normalized. * '''L2 distance (Euclidean)''' β The straight-line distance between two vectors; used in some retrieval scenarios. * '''Vector database''' β A database optimized for storing embedding vectors and performing fast approximate nearest neighbor (ANN) search. Examples: Pinecone, Weaviate, Chroma, Qdrant, Milvus, pgvector. * '''ANN (Approximate Nearest Neighbor)''' β An algorithm that finds vectors approximately close to a query vector very quickly (sacrificing exact precision for speed). * '''HNSW (Hierarchical Navigable Small World)''' β The most widely used ANN index structure, offering excellent speed-recall trade-offs. * '''Metadata filtering''' β Restricting vector search results to items matching certain criteria (e.g., only articles from 2024, only products in category "electronics"). * '''Biencoder''' β A model that encodes queries and documents independently into embedding space, enabling fast retrieval (e.g., Sentence-BERT). * '''Cross-encoder''' β A model that takes a query-document pair as input and outputs a relevance score; more accurate than biencoder but much slower (used for reranking). * '''Chunking''' β Splitting large documents into smaller pieces before embedding, since embedding models have token limits. </div> <div style="background-color: #006400; color: #FFFFFF; padding: 20px; border-radius: 8px; margin-bottom: 15px;">
Summary:
Please note that all contributions to BloomWiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
BloomWiki:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Navigation menu
Personal tools
Not logged in
Talk
Contributions
Create account
Log in
Namespaces
Page
Discussion
English
Views
Read
Edit
View history
More
Search
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Tools
What links here
Related changes
Special pages
Page information