Outer Web | Explore

Explore >> Select a destination

You are here		0x65.dev Indexing Billions of Text Vectors
\|	\|	ravendb.net Scaling HNSW in RavenDB: Optimizing for inadequate hardware - Ayende @ Rahien	1.6 parsecs away Travel
\|	\|	RavenDB 7.0 introduces vector search using the Hierarchical Navigable Small World (HNSW) algorithm, a graph-based approach for Approximate Nearest Neighbor s...	1.6 parsecs away Travel
\|	\|	erikbern.com New benchmarks for approximate nearest neighbors · Erik Bernhardsson	2.1 parsecs away Travel
\|	\|	One of my super nerdy interests include approximate algorithms for nearest neighbors in high-dimensional spaces. The problem is simple. You have say 1M points in some high-dimensional space. Now given a query point, can you find the nearest points out of the 1M set? Doing this fast turns out to be tricky.	2.1 parsecs away Travel
\|	\|	lantern.dev Estimating memory footprint of your HNSW index \| Lantern Blog	2.2 parsecs away Travel
\|	\|	This interactive visualization will help you quickly reason about the resources necssary to host your embeddings and serve nearest neighbor queries over them	2.2 parsecs away Travel
\|	\|	garrit.xyz To prove something is true, try disproving it first \| Garrit's Notes	34.2 parsecs away Travel
\|		Generalist software developer writing about scalable infrastructure, fullstack development and DevOps practices.	34.2 parsecs away Travel