Alternatives and similar repositories for search-index-benchmark-game:

Users that are interested in search-index-benchmark-game are comparing it to the libraries listed below

• quickwit-oss / search-benchmark-game
  Search engine benchmark (Tantivy, Lucene, PISA, ...)
  ☆86Updated last week
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆57Updated last year
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆96Updated last month
• osyoyu / tantivy-tokenizer-tiny-segmenter
  A Japanese tokenizer for Tantivy, based on TinySegmenter.
  ☆14Updated 4 years ago
• quickwit-oss / bitpacking
  SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
  ☆302Updated 10 months ago
• k-yomo / ostrich
  WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy
  ☆15Updated 2 years ago
• MnO2 / cedarwood
  Efficiently-updatable double-array trie in Rust (ported from cedar)
  ☆100Updated 2 years ago
• finalfusion / finalfrontier
  Context-sensitive word embeddings with subwords. In Rust.
  ☆87Updated last year
• pisa-engine / ciff
  The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative
  ☆10Updated last month
• sunchao / leveldb-rs
  LevelDB: Rust implementation
  ☆80Updated 5 years ago
• laysakura / fst-rs
  FST (Fast Succinct Trie) implementation in Rust
  ☆26Updated 5 years ago
• RoaringBitmap / croaring-rs
  Rust FFI wrapper for CRoaring
  ☆157Updated 3 weeks ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆36Updated last year
• sdleffler / qp-trie-rs
  An idiomatic and fast QP-trie implementation in pure Rust.
  ☆100Updated last year
• daac-tools / daachorse
  🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
  ☆213Updated 3 months ago
• CurrySoftware / perlin
  Perlin: An Efficient and Ergonomic Document Search-Engine
  ☆77Updated 7 years ago
• quickwit-oss / levenshtein-automata
  ☆65Updated 2 years ago
• sujayakar / rsdict
  ☆48Updated last year
• tabac / hyperloglog.rs
  HyperLogLog implementations.
  ☆23Updated 8 months ago
• lerouxrgd / ngt-rs
  Rust wrappers for NGT approximate nearest neighbor search
  ☆38Updated 11 months ago
• mooreniemi / suntan
  A utility to dump Elasticsearch Lucene shards into Tantivy.
  ☆12Updated 3 years ago
• tomarrell / rust-elias-fano
  Elias-Fano encoding implementation in Rust
  ☆31Updated 5 years ago
• jedisct1 / rust-hyperloglog
  A HyperLogLog implementation in Rust.
  ☆50Updated last month
• faster-rs / faster-rs
  Experimental Rust wrapper for FASTER by Microsoft Research
  ☆54Updated 4 years ago
• rust-cv / hnsw
  HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
  ☆233Updated 3 months ago
• alecmocatta / streaming_algorithms
  Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
  ☆86Updated 8 months ago
• jonhoo / rust-zipf
  Rust implementation of a fast, bounded, Zipf-distributed random number generator
  ☆34Updated 2 months ago
• prataprc / xorfilter
  Rust library implementing xor-filters
  ☆140Updated last year
• crepererum / rdxsort-rs
  Fast RadixSort in Rust
  ☆12Updated 6 years ago