jason-wolfe / search-index-benchmark-gameLinks
☆15Updated 2 years ago
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
Sorting:
- Search engine benchmark (Tantivy, Lucene, PISA, ...)☆92Updated 3 weeks ago
- At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).☆80Updated 2 years ago
- WIP: Full text search engine library written in Go with 1.18+ Generics, heavily inspired by Tantivy☆14Updated 2 years ago
- 🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.☆233Updated 3 months ago
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆315Updated last year
- Succinct Data Structures for Rust☆57Updated 4 months ago
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆42Updated last year
- Collection of succinct data structures in Rust☆99Updated 2 months ago
- Rust library implementing xor-filters☆140Updated 2 years ago
- Efficiently-updatable double-array trie in Rust (ported from cedar)☆104Updated 2 years ago
- Perlin: An Efficient and Ergonomic Document Search-Engine☆77Updated 7 years ago
- Fast suffix arrays for Rust (with Unicode support).☆275Updated 2 years ago
- The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative☆11Updated 2 months ago
- Rust FFI wrapper for CRoaring☆160Updated last week
- Experimental Rust wrapper for FASTER by Microsoft Research☆55Updated 5 years ago
- Rust library providing fast language model queries in compressed space☆26Updated 3 years ago
- HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"☆245Updated 2 months ago
- 🦞 Rust library of natural language dictionaries using character-wise double-array tries.☆35Updated 8 months ago
- Rust implementation for T1HA (Fast Positive Hash)☆90Updated last year
- A Japanese tokenizer for Tantivy, based on TinySegmenter.☆14Updated 4 years ago
- ☆12Updated 7 years ago
- A rust implementation of murmur3☆71Updated last year
- Double Array Trie in Rust☆54Updated 6 years ago
- Elias-Fano encoding implementation in Rust☆32Updated 6 years ago
- An embedded persistent key-value storage for Rust that is optimized for random-access workload and huge-capacity HDD☆112Updated 4 years ago
- A HyperLogLog implementation in Rust.☆51Updated 7 months ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- Implementation of Adaptive Radix Tree in Rust☆43Updated 5 years ago
- Rust implementation of SIMD-oriented Fast Mersenne Twister (SFMT) using stable SIMD☆33Updated 4 years ago
- Context-sensitive word embeddings with subwords. In Rust.☆87Updated last year