quickwit-oss / search-benchmark-gameLinks
Search engine benchmark (Tantivy, Lucene, PISA, ...)
☆96Updated 2 months ago
Alternatives and similar repositories for search-benchmark-game
Users that are interested in search-benchmark-game are comparing it to the libraries listed below
Sorting:
- Performant implementations of various streaming algorithms, including Count–min sketch, Top k, HyperLogLog, Reservoir sampling.☆88Updated last year
- Log search engine on object storages☆19Updated last year
- scan-resistant concurrent lazy LRU☆63Updated 2 years ago
- At-a-glance overview diagrams of Apache Lucene's default PostingsFormat (inverted index binary format).☆81Updated 2 years ago
- Tantivy directory implementation backed by object_store☆37Updated last year
- Rust library implementing xor-filters☆142Updated 2 years ago
- partial_sort is Rust version of [std::partial_sort](https://en.cppreference.com/w/cpp/algorithm/partial_sort)☆21Updated last month
- ☆12Updated 5 years ago
- super simple in-memory blocking LSM for constant-size keys and values☆72Updated 9 months ago
- ☆15Updated 2 years ago
- Embeddable Aggregate Management System for Streams and Queries.☆100Updated last week
- Minimal, exact vector search with metadata filtering. Think "Polars for vector search."☆32Updated 2 weeks ago
- Percas is a distributed PERsistent CAche Service.☆94Updated this week
- Bindings for writing a server that can act as MySQL/MariaDB☆172Updated this week
- A HyperLogLog implementation in Rust.☆51Updated 8 months ago
- A Rust-implementation of a stable Bloom filter for filtering duplicates out of data streams.☆42Updated 6 years ago
- ☆28Updated 3 months ago
- A basic log-structured flash datastore☆20Updated 3 years ago
- ☆11Updated 5 years ago
- SQL Benchmark derived from TPC-DS☆15Updated 2 years ago
- Comparing performance-oriented string-processing libraries for substring search, multi-pattern matching, hashing, edit-distances, sketchi…☆117Updated 2 weeks ago
- A native storage format for apache arrow☆82Updated 2 years ago
- This crate implements the "eytzinger" (aka BFS) array layout where a binary search tree is stored by layer (instead of as a sorted array)…☆24Updated 4 years ago
- logq - Analyzing log files in PartiQL with command-line toolkit, implemented in Rust☆46Updated 2 years ago
- Robust data transformation tool using SQL☆22Updated 2 years ago
- PartiQL libraries and tools in Rust.☆73Updated 2 months ago
- A redis-like cache store that implements CRDTs and active-active replications.☆42Updated 2 years ago
- Write Ahead Logging for Rust☆33Updated last month
- A set of tools for writing servers that speak PostgreSQL's wire protocol☆93Updated last month
- Demonstrations of (in)consistency in various streaming systems.☆23Updated 4 years ago