axel-bacher / mergeshuffleLinks
☆49Updated 10 years ago
Alternatives and similar repositories for mergeshuffle
Users that are interested in mergeshuffle are comparing it to the libraries listed below
Sorting:
- A simple re-implementation of Google's sparsehash as a learning excercise.☆40Updated last year
- Classp -- a classier way to parse☆169Updated 8 years ago
- Speculative Paxos replication protocol☆133Updated 9 years ago
- ScalienDB is a scalable, replicated datastore.☆87Updated 12 years ago
- ☆171Updated 10 years ago
- Data structure server.☆181Updated 9 years ago
- A very fast scalar implementation for Frame Of Reference integer compression.☆109Updated 10 years ago
- TAPIR distributed transactional storage system☆423Updated 5 years ago
- Behrooz File System (BFS)☆54Updated 10 years ago
- invesdwin-context modules that provide persistence features☆44Updated last week
- Simple code generator☆249Updated last year
- Single-threaded graph computation in Rust☆256Updated 6 years ago
- Demonstrating the importance of laying out data in memory.☆47Updated 7 years ago
- No sane compiler would optimize atomics: the presentation☆108Updated 9 years ago
- Keyvi - a key value index that powers Cliqz search engine. It is an in-memory FST-based data structure highly optimized for size and look…☆177Updated 6 years ago
- MetroHash v1: Exceptionally fast and statistically robust hash functions☆370Updated 3 years ago
- C network daemon for HyperLogLogs☆451Updated 4 years ago
- FlashX is a collection of big data analytics tools that perform data analytics in the form of graphs and matrices.☆237Updated 5 years ago
- Snabb: simple and fast packet networking☆81Updated 6 years ago
- ☆329Updated 9 years ago
- Bill McCloskey's memoize.py, grabbed with archive.org from http://www.eecs.berkeley.edu/~billm/memoize.html☆117Updated 2 years ago
- A highly-flexible thread pool for Rust☆180Updated 9 years ago
- Implementations of a data structure with false negatives but no false positives.☆358Updated last year
- Experiments with array layouts for comparison-based searching☆84Updated last year
- ☆60Updated 3 years ago
- Ekam Build System☆232Updated 2 years ago
- Fun with time travel: Implementing retroactive data structures in Python☆225Updated 4 years ago
- My implementations of deterministic and non-deterministic turing machines☆71Updated 2 years ago
- Create an index on a compressed text file☆645Updated 2 years ago
- Benchmark showing the we can randomly hash strings very quickly with good universality☆139Updated 9 months ago