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, ...)
  ☆82Updated 3 months ago
• mocobeta / lucene-postings-format
  At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).
  ☆80Updated last year
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆57Updated last year
• k-yomo / ostrich
  WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy
  ☆15Updated last year
• finalfusion / finalfrontier
  Context-sensitive word embeddings with subwords. In Rust.
  ☆87Updated last year
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• daac-tools / crawdad
  🦞 Rust library of natural language dictionaries using character-wise double-array tries.
  ☆29Updated last month
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆34Updated 11 months ago
• osyoyu / tantivy-tokenizer-tiny-segmenter
  A Japanese tokenizer for Tantivy, based on TinySegmenter.
  ☆14Updated 3 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• daac-tools / daachorse
  🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
  ☆210Updated last month
• jonhoo / rust-zipf
  Rust implementation of a fast, bounded, Zipf-distributed random number generator
  ☆33Updated last week
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆82Updated last year
• MnO2 / cedarwood
  Efficiently-updatable double-array trie in Rust (ported from cedar)
  ☆98Updated 2 years ago
• faster-rs / faster-rs
  Experimental Rust wrapper for FASTER by Microsoft Research
  ☆54Updated 4 years ago
• fulmicoton / kuromoji-rs
  Japanese tokenizer for rust
  ☆35Updated 5 years ago
• MnO2 / zw-fast-quantile
  Zhang Wang Fast Approximate Quantiles Algorithm in Rust
  ☆13Updated 3 years ago
• tomarrell / rust-elias-fano
  Elias-Fano encoding implementation in Rust
  ☆30Updated 5 years ago
• quickwit-oss / levenshtein-automata
  ☆63Updated last year
• sundy-li / partial_sort
  partial_sort is Rust version of [std::partial_sort](https://en.cppreference.com/w/cpp/algorithm/partial_sort)
  ☆19Updated 2 months ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆52Updated this week
• sujayakar / rsdict
  ☆47Updated 10 months ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆68Updated this week
• laysakura / fst-rs
  FST (Fast Succinct Trie) implementation in Rust
  ☆25Updated 5 years ago
• kampersanda / tongrams-rs
  Rust library providing fast language model queries in compressed space
  ☆23Updated 2 years ago
• rust-cv / hnsw
  HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"
  ☆226Updated 3 weeks ago
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆135Updated 10 months ago
• CurrySoftware / perlin
  Perlin: An Efficient and Ergonomic Document Search-Engine
  ☆77Updated 7 years ago
• alecmocatta / streaming_algorithms
  Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.
  ☆86Updated 6 months ago
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆36Updated 9 months ago