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
  ☆26Updated 8 months 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
• jean-pierreBoth / hnswlib-rs
  Rust implementation of the HNSW algorithm (Malkov-Yashunin)
  ☆225Updated last month
• nnethercott / hannoy
  Production-ready KV-backed HNSW implementation in Rust using LMDB
  ☆66Updated this week
• yankun1992 / fastbloom
  A fast bloom filter implemented by Rust for Python! 10x faster than pybloom!
  ☆107Updated 4 months ago
• dapper91 / ext-sort-rs
  rust external sort algorithm implementation
  ☆20Updated 8 months ago
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆101Updated 5 months ago
• tabac / hyperloglog.rs
  HyperLogLog implementations.
  ☆27Updated last year
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆104Updated 8 months ago
• ritchie46 / lsh-rs
  Locality Sensitive Hashing in Rust with Python bindings
  ☆120Updated 2 years ago
• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆151Updated 3 months ago
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆48Updated this week
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆31Updated 6 months ago
• meilisearch / arroy
  An Approximate Nearest Neighbors library in Rust, based on random projections and LMDB and optimized for memory usage
  ☆297Updated 2 months ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆46Updated 2 weeks ago
• rust-cv / hnsw
  HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
  ☆253Updated 5 months ago
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆127Updated 3 weeks ago
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆102Updated 2 months ago
• jean-pierreBoth / annembed
  data embedding based on approximate nearest neighbour
  ☆37Updated last week
• RagnarGrootKoerkamp / PtrHash
  PtrHash minimal perfect hash function
  ☆87Updated 4 months ago
• main-- / rust-intervaltree
  ☆21Updated last year
• regexident / rust-seal
  Rust implementation of Needleman-Wunsch & Smith-Waterman sequence alignment
  ☆22Updated 6 months ago
• frjnn / bhtsne
  Parallel Barnes-Hut t-SNE implementation written in Rust.
  ☆89Updated 5 months ago
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆146Updated last year
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆69Updated 6 months ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆67Updated 3 weeks ago
• vigna / webgraph-rs
  A Rust port of the WebGraph framework
  ☆58Updated 3 weeks ago
• finalfusion / finalfusion-rust
  finalfusion embeddings in Rust
  ☆105Updated 2 years ago
• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆17Updated last year
• genbattle / rkm
  Generic k-means implementation written in Rust
  ☆16Updated 5 years ago