vadiminshakov / committerLinks
Two-phase (2PC) and three-phase (3PC) protocols implementaion in Golang
☆40Updated last month
Alternatives and similar repositories for committer
Users that are interested in committer are comparing it to the libraries listed below
Sorting:
- A slick BTree on disk based key value store implemented in pure Go☆150Updated 3 years ago
- A flexible multi-layer Go caching library to deal with in-memory and shared cache by adopting Cache-Aside pattern.☆160Updated 2 years ago
- Storage algorithms.☆38Updated 4 years ago
- A collection of best practices and lessons learnt from applying concurrency in go.☆111Updated 7 months ago
- When storing a value in a Go interface allocates memory on the heap.☆72Updated 3 years ago
- high performance key value database written in Go. Deprecated. Use robaho/leveldb☆87Updated 3 years ago
- An implementation of Consistent Hashing with Bounded Loads (using Red-Black tree)☆48Updated 6 years ago
- Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.☆43Updated 5 years ago
- on-disk hash table(mainly for WAL).☆29Updated 2 years ago
- A simplified implementation for log structured merge tree.☆62Updated 4 years ago
- skipset is a high-performance, scalable concurrent sorted set based on skip-list. Up to 15x faster than sync.Map in the typical pattern.☆263Updated 2 years ago
- In memory sharded cache implementation☆35Updated 4 years ago
- Interactive Assembler for Go☆67Updated last year
- ☆34Updated 4 years ago
- Lock-free MPMC Ring Buffer (Generic) for SMP, in golang. Some posts in chinese:☆107Updated 2 months ago
- Package netpoll implements a network poller based on epoll/kqueue.☆59Updated 2 years ago
- Cache benchmark for Golang☆77Updated 2 years ago
- Benchmarks for BigCache project☆20Updated last year
- A fast little LRU cache for Go☆174Updated 2 years ago
- Eventually consistent distributed in-memory cache Go library☆162Updated 2 years ago
- A fast, reliable, simple hashmap that only supports the uint64 key/value. Faster than the runtime hashmap in almost all cases.☆25Updated 8 months ago
- TinyLFU cache admission policy☆267Updated 10 months ago
- A persistent storage (in file) based using B+ tree with byte-slice keys and values☆28Updated 3 years ago
- Write Ahead Log for LSM or bitcask storage(or any append-only write).☆277Updated 10 months ago
- B-tree implementation for Go☆239Updated 3 years ago
- ☆123Updated 2 years ago
- Native persistent memory support for Go☆83Updated 3 years ago
- Examples for Dragonboat☆192Updated last year
- A Bitcask (LSM+WAL) Key/Value Store written in Go.☆37Updated 6 years ago
- Straightforward implementation of Raft Consensus☆66Updated 4 years ago