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, ...)
  ☆89Updated last month
• pisa-engine / ciff
  The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative
  ☆10Updated last month
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆96Updated 2 months ago
• rossanoventurini / Variable-BMW
  ☆12Updated 7 years ago
• daac-tools / crawdad
  🦞 Rust library of natural language dictionaries using character-wise double-array tries.
  ☆31Updated 4 months ago
• CurrySoftware / perlin
  Perlin: An Efficient and Ergonomic Document Search-Engine
  ☆77Updated 7 years ago
• MnO2 / cedarwood
  Efficiently-updatable double-array trie in Rust (ported from cedar)
  ☆102Updated 2 years ago
• mocobeta / lucene-postings-format
  At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).
  ☆80Updated 2 years ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆40Updated last year
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated last year
• k-yomo / ostrich
  WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy
  ☆14Updated 2 years ago
• kampersanda / tongrams-rs
  Rust library providing fast language model queries in compressed space
  ☆24Updated 2 years ago
• quickwit-oss / bitpacking
  SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
  ☆307Updated 11 months ago
• andelf / rust-darts
  Double Array Trie in Rust
  ☆53Updated 5 years ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆58Updated 2 weeks ago
• osyoyu / tantivy-tokenizer-tiny-segmenter
  A Japanese tokenizer for Tantivy, based on TinySegmenter.
  ☆14Updated 4 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• hsivonen / simd
  A crate that exposes some SIMD functionality on nightly Rust; to be obsoleted by stdsimd
  ☆82Updated last year
• quickwit-oss / levenshtein-automata
  ☆66Updated 2 years ago
• RoaringBitmap / croaring-rs
  Rust FFI wrapper for CRoaring
  ☆158Updated this week
• daac-tools / daachorse
  🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
  ☆217Updated 5 months ago
• MnO2 / zw-fast-quantile
  Zhang Wang Fast Approximate Quantiles Algorithm in Rust
  ☆13Updated 3 years ago
• sundy-li / partial_sort
  partial_sort is Rust version of [std::partial_sort](https://en.cppreference.com/w/cpp/algorithm/partial_sort)
  ☆19Updated 5 months ago
• finalfusion / finalfrontier
  Context-sensitive word embeddings with subwords. In Rust.
  ☆87Updated last year
• servo / smallbitvec
  A growable bit-vector for Rust, optimized for size
  ☆40Updated 3 months ago
• BurntSushi / suffix
  Fast suffix arrays for Rust (with Unicode support).
  ☆274Updated last year
• faster-rs / faster-rs
  Experimental Rust wrapper for FASTER by Microsoft Research
  ☆54Updated 4 years ago
• laysakura / fst-rs
  FST (Fast Succinct Trie) implementation in Rust
  ☆26Updated 6 years ago
• jonhoo / rust-zipf
  Rust implementation of a fast, bounded, Zipf-distributed random number generator
  ☆34Updated 3 months ago
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆139Updated last year