jason-wolfe / search-index-benchmark-game

Related projects ⓘ

Alternatives and complementary repositories for search-index-benchmark-game

• quickwit-oss / search-benchmark-game
  Search engine benchmark (Tantivy, Lucene, PISA, ...)
  ☆79Updated last month
• mocobeta / lucene-postings-format
  At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).
  ☆78Updated last year
• quickwit-oss / bitpacking
  SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.
  ☆273Updated 5 months ago
• faster-rs / faster-rs
  Experimental Rust wrapper for FASTER by Microsoft Research
  ☆53Updated 4 years ago
• k-yomo / ostrich
  WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy
  ☆15Updated last year
• rossanoventurini / Variable-BMW
  ☆11Updated 7 years ago
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆56Updated 10 months ago
• MnO2 / cedarwood
  Efficiently-updatable double-array trie in Rust (ported from cedar)
  ☆96Updated last year
• osyoyu / tantivy-tokenizer-tiny-segmenter
  A Japanese tokenizer for Tantivy, based on TinySegmenter.
  ☆14Updated 3 years ago
• jedisct1 / rust-hyperloglog
  A HyperLogLog implementation in Rust.
  ☆50Updated 3 months ago
• CurrySoftware / perlin
  Perlin: An Efficient and Ergonomic Document Search-Engine
  ☆76Updated 6 years ago
• osirrc / ciff
  Common Index File Format to to support interoperability between open-source IR engines
  ☆31Updated 2 months ago
• kampersanda / sucds
  Collection of succinct data structures in Rust
  ☆81Updated 9 months ago
• takuyaa / yada
  Yada is a yet another double-array trie library aiming for fast search and compact data representation.
  ☆31Updated 8 months ago
• jonhoo / rust-zipf
  Rust implementation of a fast, bounded, Zipf-distributed random number generator
  ☆30Updated last week
• daac-tools / daachorse
  🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.
  ☆203Updated last month
• ibmandura / ArtTree
  Implementation of Adaptive Radix Tree in Rust
  ☆42Updated 4 years ago
• andelf / rust-darts
  Double Array Trie in Rust
  ☆51Updated 5 years ago
• ezrosent / art-rs
  Adaptive Radix Tree in Rust
  ☆62Updated 6 years ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆47Updated this week
• vigna / webgraph-rs
  A Rust port of the WebGraph framework
  ☆33Updated this week
• stusmall / murmur3
  A rust implementation of murmur3
  ☆68Updated last month
• laysakura / fst-rs
  FST (Fast Succinct Trie) implementation in Rust
  ☆24Updated 5 years ago
• zonyitoo / conhash-rs
  Consistent Hashing library in Rust
  ☆18Updated last year
• mayah / x86intrin
  x86 intrinsics for rust
  ☆40Updated 6 years ago
• servo / smallbitvec
  A growable bit-vector for Rust, optimized for size
  ☆39Updated 8 months ago
• KeenS / tokio-thrift
  Thrift RPC in Rust (Async I/O) with tokio
  ☆20Updated 7 years ago
• zhao-lang / redis_hnsw
  HSNW module for Redis
  ☆57Updated 4 years ago
• vasi / positioned-io
  Read and write from offsets in Rust.
  ☆76Updated 6 months ago
• fujita / greeter
  ☆62Updated 3 years ago