jason-wolfe / search-index-benchmark-gameLinks
☆14Updated 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, ...)☆90Updated last month
- At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).☆80Updated 2 years ago
- 🐎 A fast implementation of the Aho-Corasick algorithm using the compact double-array data structure in Rust.☆227Updated last month
- 🦞 Rust library of natural language dictionaries using character-wise double-array tries.☆31Updated 6 months ago
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆310Updated last year
- Yada is a yet another double-array trie library aiming for fast search and compact data representation.☆41Updated last year
- The inverted index exchange format as defined as part of the Open-Source IR Replicability Challenge (OSIRRC) initiative☆11Updated this week
- Collection of succinct data structures in Rust☆99Updated this week
- Efficiently-updatable double-array trie in Rust (ported from cedar)☆104Updated 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 Japanese tokenizer for Tantivy, based on TinySegmenter.☆14Updated 4 years ago
- Succinct Data Structures for Rust☆58Updated last month
- Fast suffix arrays for Rust (with Unicode support).☆274Updated last year
- DiskANNrs☆18Updated 5 months ago
- ☆12Updated 7 years ago
- Experimental Rust wrapper for FASTER by Microsoft Research☆55Updated 4 years ago
- Rust FFI wrapper for CRoaring☆158Updated last month
- HNSW ANN from the paper "Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs"☆237Updated 6 months ago
- Double Array Trie in Rust☆54Updated 6 years ago
- Context-sensitive word embeddings with subwords. In Rust.☆87Updated last year
- Japanese tokenizer for rust☆35Updated 5 years ago
- A ball-tree implementation for K-NN☆17Updated 10 months ago
- Elias-Fano encoding implementation in Rust☆32Updated 6 years ago
- Perlin: An Efficient and Ergonomic Document Search-Engine☆77Updated 7 years ago
- Rust library implementing xor-filters☆140Updated 2 years ago
- SIMD Floating point and integer compressed vector library☆80Updated last year
- Fast RadixSort in Rust☆12Updated 6 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 3 years ago
- Adaptive Radix Tree in Rust☆67Updated 7 years ago
- Rust library providing fast language model queries in compressed space☆24Updated 2 years ago