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, ...)
  ☆83Updated 5 months ago
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆57Updated 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
• rossanoventurini / Variable-BMW
  ☆12Updated 7 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
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆96Updated 3 weeks ago
• daac-tools / daachorse
  🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
  ☆213Updated 3 months ago
• faster-rs / faster-rs
  Experimental Rust wrapper for FASTER by Microsoft Research
  ☆54Updated 4 years ago
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆38Updated 3 weeks ago
• andelf / rust-darts
  Double Array Trie in Rust
  ☆52Updated 5 years ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆35Updated last year
• daac-tools / crawdad
  🦞 Rust library of natural language dictionaries using character-wise double-array tries.
  ☆30Updated 2 months ago
• 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
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆55Updated this week
• MnO2 / cedarwood
  Efficiently-updatable double-array trie in Rust (ported from cedar)
  ☆100Updated 2 years ago
• CurrySoftware / perlin
  Perlin: An Efficient and Ergonomic Document Search-Engine
  ☆77Updated 7 years ago
• osyoyu / tantivy-tokenizer-tiny-segmenter
  A Japanese tokenizer for Tantivy, based on TinySegmenter.
  ☆14Updated 4 years ago
• PsiACE / bitsvec
  A bit vector with the Rust standard library's portable SIMD API.
  ☆39Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• ibmandura / ArtTree
  Implementation of Adaptive Radix Tree in Rust
  ☆43Updated 5 years ago
• jedisct1 / rust-hyperloglog
  A HyperLogLog implementation in Rust.
  ☆50Updated 3 weeks ago
• quickwit-oss / levenshtein-automata
  ☆65Updated 2 years ago
• servo / smallbitvec
  A growable bit-vector for Rust, optimized for size
  ☆40Updated last month
• iwiwi / parallel-radix-sort
  An implementation of optimized parallel radix sort
  ☆49Updated 6 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 3 months ago
• Lagrang / bztree-rs
  BzTree implementation for Rust
  ☆35Updated last year
• messense / fasttext-rs
  fastText Rust binding
  ☆59Updated last year
• sdleffler / qp-trie-rs
  An idiomatic and fast QP-trie implementation in pure Rust.
  ☆100Updated 11 months ago