ORBiS Tree

ORBiS TREE · ENGLISH DOCUMENT

Concepts →

Vector Search

Search that retrieves items by similarity between numerical vector representations.

한국어 English
English updated 8월 29, 2026 Source article updated 8월 29, 2026 1 sources
This English page is a curated translation layer linked to the Korean source article. Community changes are currently made on the Korean source, where the full revision history and anonymous edit trail are preserved.
Vector search retrieves records whose embeddings are close to a query embedding. It is commonly used when semantic similarity matters more than exact keyword overlap.

How it works

A system first creates embeddings for documents or items and stores them in a vector index. At query time it embeds the query and performs exact or approximate nearest-neighbor search using a chosen similarity metric.

Why it matters

Vector search is a core component of many semantic-search and RAG systems. Good retrieval still depends on chunking, embedding quality, metadata filtering, index configuration, and evaluation.

Related concepts

SOURCES

Sources

  1. Billion-scale similarity search with GPUsFacebook AI Research / arXiv
    Open source ↗