bryankate / pequodLinks
A distributed key-value cache with builtin materialized views.
☆26Updated 10 years ago
Alternatives and similar repositories for pequod
Users that are interested in pequod are comparing it to the libraries listed below
Sorting:
- A system for maintaining replicated state machines☆115Updated 8 years ago
- Parses and executes Runway models of distributed systems☆50Updated 3 years ago
- A small DFA for under 16 states☆51Updated 7 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- Tiny Transactions on Computer Systems (TinyToCS) Site☆32Updated 9 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 12 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- Restartable Sequences: a userspace implementation of cheap per-cpu atomic operations☆37Updated 6 years ago
- Feed-forward Bloom filters☆52Updated 14 years ago
- Compact tries for fixed-width keys☆26Updated 7 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- ☆24Updated 10 years ago
- Paxos-replicated key-value store in 3 hours or less.☆25Updated 8 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- TLA+ and Alloy specs of database isolation☆20Updated 9 years ago
- Concurrent Log-Structured Memory for Many-Core Key-Value Stores☆35Updated 5 years ago
- bit & sketches data structures☆60Updated 6 years ago
- AllConcur: Algorithm for LeaderLess CONCURrent atomic broadcast☆31Updated 8 years ago
- (getting to be a) hard to kill scalable linearizabe store☆79Updated 9 years ago
- A threaded, continuations-based I/O event library for manycore NUMA machines☆73Updated 4 years ago
- Prototype of FPaxos, built upon LibPaxos3☆48Updated 5 years ago
- Wannabe Main Memory Database and More☆53Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆84Updated last year
- qp tries and crit-bit tries☆121Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- A qp-trie implementation in Rust☆44Updated 6 months ago
- Distributed Systems Reading Group☆20Updated 7 years ago
- finding set bits in large bitmaps☆15Updated 9 years ago
- Fast 64 bit evolved hash.☆33Updated 8 years ago