peterall / pruning_radix_trieLinks
Rust implementation of Pruning Radix Trie, originally by Wolf Garbe
☆34Updated last year
Alternatives and similar repositories for pruning_radix_trie
Users that are interested in pruning_radix_trie are comparing it to the libraries listed below
Sorting:
- ☆63Updated 3 months ago
- ☆81Updated 4 years ago
- 🃏 A distributed unique ID generator inspired by Twitter's Snowflake.☆190Updated last month
- Flexible, Fast & Compact Serialization with RPC☆378Updated 2 years ago
- ☆38Updated 3 years ago
- ☆144Updated 5 months ago
- Embedded Key-Value Storage Engine☆141Updated 2 months ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆176Updated 5 months ago
- Succinct data structures using very efficient rank and select☆128Updated last month
- An Adaptive Radix Tree implementation.☆48Updated 5 months ago
- Message queue implemented on top of PostgreSQL☆155Updated 7 months ago
- Variant of Rust's std::Arc that supports atomic replacement of the value.☆123Updated 4 months ago
- Glommio Messaging Framework (GMF) is a high-performance RPC system designed to work with the Glommio framework.☆57Updated 2 years ago
- A pure Rust database implementation using an append-only B-Tree file format.☆278Updated 2 years ago
- Distributed stress testing framework in Rust☆118Updated 11 months ago
- A very fast Key-Value store in pure rust☆219Updated this week
- A concurrent, append-only vector.☆209Updated 5 months ago
- A lightweight low-level single-threaded actor runtime☆181Updated last week
- Prioritised, parallel job scheduler with concurrent exclusion, job merging, recurring jobs and load limiting for lower priorities.☆46Updated 4 years ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆154Updated last month
- Utilities for working with shared slices of memory☆83Updated 6 months ago
- Concurrently Readable Data Structures for Rust☆363Updated last week
- A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…☆107Updated last week
- The feature-rich, portable async channel library☆266Updated 3 years ago
- Fantastic serialization library☆158Updated last month
- A graph crate with simplicity in mind☆89Updated 2 years ago
- ☆29Updated 2 years ago
- Mix async code with CPU-heavy thread pools using Tokio + Rayon☆150Updated 3 years ago
- A buffering MPSC queue.☆85Updated last month
- Small and fast library for k-means clustering.☆53Updated 6 months ago