Alternatives and similar repositories for cardinality-estimator:

Users that are interested in cardinality-estimator are comparing it to the libraries listed below

• rdaum / rart-rs
  An Adaptive Radix Tree implementation.
  ☆38Updated last year
• komora-io / sharded-log
  log for concurrent workloads, with support for atomic batches and in-order recovery
  ☆33Updated 2 years ago
• komora-io / art
  Adaptive Radix Trie implementation for fixed-length keys
  ☆53Updated last year
• komora-io / ebr
  high-efficiency concurrent reclamation
  ☆35Updated 5 months ago
• komora-io / tiny-lsm
  super simple in-memory blocking LSM for constant-size keys and values
  ☆68Updated this week
• spiraldb / fastlanes
  Rust implementation of the FastLanes compression library
  ☆94Updated last month
• jedisct1 / rust-clockpro-cache
  CLOCK-Pro cache replacement algorithm for Rust
  ☆26Updated 11 months ago
• jedisct1 / rust-hyperloglog
  A HyperLogLog implementation in Rust.
  ☆50Updated 3 weeks ago
• laysakura / fst-rs
  FST (Fast Succinct Trie) implementation in Rust
  ☆25Updated 5 years ago
• selmeci / cascara
  An implementation of TinyLFU cache
  ☆15Updated 2 years ago
• komora-io / inline-array
  ☆10Updated 4 months ago
• komora-io / cache-advisor
  scan-resistant concurrent lazy LRU
  ☆58Updated last year
• jonhoo / rust-zipf
  Rust implementation of a fast, bounded, Zipf-distributed random number generator
  ☆33Updated last week
• harharkh / mayda
  A Rust library to compress integer arrays.
  ☆39Updated 6 years ago
• wvwwvwwv / scalable-delayed-dealloc
  Scalable and lock-free memory reclamation system
  ☆22Updated 2 weeks ago
• declanvk / blart
  ☆35Updated 3 months ago
• khonsulabs / sediment
  A low-level MVCC file format for storing blobs.
  ☆63Updated 11 months ago
• uccidibuti / bitrush-index
  A serializable bitmap index library able to index millions values/sec on a single thread.
  ☆18Updated last year
• fralalonde / mayda
  Fast Rust integer compression using SIMD
  ☆11Updated 6 years ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆89Updated 11 months ago
• bastion-rs / numanji
  Local-affinity first NUMA-aware allocator with optional fallback.
  ☆23Updated 3 years ago
• axiomhq / hypertwobits
  HyperTwoBits implementation
  ☆12Updated 2 months ago
• frankmcsherry / columnation
  An experimental columnar arena
  ☆42Updated 3 months ago
• velvia / compressed-vec
  SIMD Floating point and integer compressed vector library
  ☆79Updated last year
• pchickey / task-group
  ☆33Updated 2 years ago
• al8n / skl
  A lock-free thread-safe concurrent SkipMap implementation based on ARENA skiplist which helps develop MVCC memtable for LSM-Tree.
  ☆55Updated this week
• spacejam / rsdb
  rust database engineering toolkit
  ☆33Updated 3 years ago
• fulmicoton / fastdivide
  ☆23Updated 3 months ago
• dtolnay / oqueue
  Non-interleaving multithreaded output queue
  ☆71Updated this week