ConceptSystems & CS
Hierarchical Navigable small world
HNSW is a graph-based vector index algorithm that operates as a skiplist over a proximity graph with nodes connected to a small number of neighbors.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Greedy search1Proximity graphs1
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.