Explore >> Select a destination

You are here

 0x65.dev
Indexing Billions of Text Vectors
| | mccormickml.com
Product Quantizers for k-NN Tutorial Part 1 · Chris McCormick
12.6 parsecs away

Travel
| |
| | ravendb.net
Scaling HNSW in RavenDB: Optimizing for inadequate hardware - Ayende @ Rahien
9.0 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...
| | erikbern.com
New benchmarks for approximate nearest neighbors · Erik Bernhardsson
8.3 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.
| | clemenswinter.com
How to Read 100s of Millions of Records per Second from a Single Disk | Clemens' Blog
103.1 parsecs away

Travel
| This article gives an overview of the implementation and performance of two recent additions to LocustDB, an extremely fast open-source analytics database built in Rust. The first addition is support for persistent storage, the second is an lz4 compression pass for data stored on disk or cached in memory. Benchmarking LocustDB on a dataset of...