sean-public / skiplist-surveyLinks
A comparison of skip lists written in Go
☆54Updated 3 years ago
Alternatives and similar repositories for skiplist-survey
Users that are interested in skiplist-survey are comparing it to the libraries listed below
Sorting:
- Storage algorithms.☆38Updated 4 years ago
- SkeletonDB is a lock-less thread safe in memory MVCC store written in Go.☆23Updated 8 years ago
- Server for benchmarking pure Go key/value databases☆33Updated 8 years ago
- B+ tree in memory with mvcc support☆18Updated 6 years ago
- Benchmarks of Badger☆98Updated 3 years ago
- File Structures (B+Tree, BTree) for Go☆70Updated 9 years ago
- Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.☆41Updated 5 years ago
- Write ahead Raft log for Go☆58Updated 4 years ago
- A fast, threadsafe skip list in Go☆267Updated 3 years ago
- An log structured merge tree varient of nitro storage engine☆28Updated 8 years ago
- The Golang imeplentation of MVCC Hashmap☆13Updated 8 years ago
- Native persistent memory support for Go☆81Updated 2 years ago
- A key value storage example powered by hashicorp raft and BadgerDB☆104Updated 6 years ago
- Golang library for io_uring (without CGO)☆133Updated 4 years ago
- Interface for mmap syscall to provide safe and efficient access to memory☆67Updated 4 years ago
- go-jepsen is a toolset for distributed systems verification, includes SIV(Snapshot Isolation Verification) and etc...☆63Updated 7 years ago
- Fuzz Testing for the github.com/hashicorp/raft library☆30Updated 2 years ago
- high performance key value database written in Go. Deprecated. Use robaho/leveldb☆87Updated 2 years ago
- Succinct Data Structure of Trie, written in Go☆42Updated 3 years ago
- A revamped Google's jump consistent hash☆106Updated 2 years ago
- A minimal-memory AnchorHash (consistent-hash) implementation for Go☆76Updated 6 years ago
- B+ Tree☆91Updated 2 years ago
- An efficient memset implementation for Golang. [Not maintained].☆32Updated 5 years ago
- an adaptive radix tree implementation in go☆69Updated 3 years ago
- Fast and efficient data reconstruction Erasure code, saving about 30% I/O in reconstruction☆63Updated 5 years ago
- A simple and efficient hashmap package for Go. Uses open addressing, Robin Hood hashing, and xxhash algorithm.☆80Updated 3 years ago
- A fast, reliable, simple hashmap that only supports the uint64 key/value. Faster than the runtime hashmap in almost all cases.☆23Updated 3 months ago
- A pluggable implementation of the Egalitarian Paxos Consensus Protocol☆62Updated 4 years ago
- Raft in-memory backend implementation with persistence☆84Updated 4 years ago
- Persistent Block KD Tree In Golang for Search Filtering☆37Updated last year