Alternatives and similar repositories for diskann-rs

Users that are interested in diskann-rs are comparing it to the libraries listed below

• ajalab / fm-index
  FM-index for Rust
  ☆23Updated 5 months ago
• ritchie46 / lsh-rs
  Locality Sensitive Hashing in Rust with Python bindings
  ☆119Updated 2 years ago
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆109Updated 2 years ago
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆100Updated 2 months ago
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆97Updated last month
• dapper91 / ext-sort-rs
  rust external sort algorithm implementation
  ☆18Updated 5 months ago
• frjnn / bhtsne
  Parallel Barnes-Hut t-SNE implementation written in Rust.
  ☆87Updated 3 months ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆60Updated this week
• yankun1992 / fastbloom
  A fast bloom filter implemented by Rust for Python! 10x faster than pybloom!
  ☆104Updated last month
• tabac / hyperloglog.rs
  HyperLogLog implementations.
  ☆25Updated last year
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆30Updated 4 months ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆150Updated 3 weeks ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆127Updated 3 months ago
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆102Updated 6 months ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆46Updated 3 weeks ago
• jean-pierreBoth / hnswlib-rs
  Rust implementation of the HNSW algorithm (Malkov-Yashunin)
  ☆212Updated last month
• rust-cv / hnsw
  HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
  ☆245Updated 2 months ago
• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆17Updated last year
• meilisearch / arroy
  An Approximate Nearest Neighbors library in Rust, based on random projections and LMDB and optimized for memory usage
  ☆285Updated last week
• djc / instant-segment
  Fast English word segmentation in Rust
  ☆100Updated last month
• nnethercott / hannoy
  Production-ready KV-backed HNSW implementation in Rust using LMDB
  ☆17Updated last week
• vigna / webgraph-rs
  A Rust port of the WebGraph framework
  ☆56Updated last week
• tomtomwombat / hyperloglockless
  Lightning fast concurrent HyperLogLog for Rust.
  ☆42Updated 2 months ago
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆144Updated last month
• zommiommy / mem_dbg-rs
  A trait + derive to recursively compute / print the memory usage of a data structure.
  ☆33Updated 8 months ago
• AtharvBhat / otters
  Minimal, exact vector search with metadata filtering. Think "Polars for vector search."
  ☆30Updated last month
• ashvardanian / StringWars
  Comparing performance-oriented string-processing libraries for substring search, multi-pattern matching, hashing, edit-distances, sketchi…
  ☆92Updated this week
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆65Updated 3 months ago
• genbattle / rkm
  Generic k-means implementation written in Rust
  ☆16Updated 5 years ago
• main-- / rust-intervaltree
  ☆21Updated last year