Search Agentik

CtrlK

Glossary · Retrieval & memory

HNSW

HNSW is an approximate nearest neighbor algorithm that organizes vectors into layered proximity graphs, letting searches move quickly from coarse to fine layers toward the closest matches.

HNSW sits in the Retrieval & memory part of the Agentik {OS} glossary, which defines the words used to build and run AI agent systems.

Also called hierarchical navigable small world.