naqvijafar91 / cuteDBLinks
A slick BTree on disk based key value store implemented in pure Go
☆151Updated 3 years ago
Alternatives and similar repositories for cuteDB
Users that are interested in cuteDB are comparing it to the libraries listed below
Sorting:
- high performance key value database written in Go. Deprecated. Use robaho/leveldb☆87Updated 3 years ago
- Reference implementations of heap data structures in Go - treap, skew, leftlist, pairing, fibonacci☆101Updated 3 years ago
- B-tree implementation for Go☆239Updated 3 years ago
- Adaptive Radix Trees implemented in Go☆408Updated last month
- Server for benchmarking pure Go key/value databases☆162Updated 2 years ago
- A fast little LRU cache for Go☆174Updated 2 years ago
- An easy-to-use Map Reduce Go parallel-computing framework inspired by 2021 6.824 lab1. It supports multiple workers threads on a single m…☆226Updated 2 years ago
- ☆34Updated 4 years ago
- FlashDB is an embeddable, in-memory key/value database in Go (with Redis like commands and super easy to read)☆379Updated 2 years ago
- An Adaptive Radix Tree (ART) implementation in Go☆83Updated 2 years ago
- Go implementation of the Gossip protocol☆143Updated last year
- B+ Tree - List - File Structures 2 - Memory Mapped File Structures for Go☆408Updated 6 years ago
- Fast and easy-to-use skip list for Go.☆430Updated last year
- A simplified implementation for log structured merge tree.☆62Updated 4 years ago
- fast int64-int64 map for go☆98Updated last month
- Implementation of Chord DHT(Distributed Hash Table) paper☆192Updated 4 years ago
- ⚡️ lock-free utilities in Go☆163Updated last year
- A buffer pool file I/O library for Go☆55Updated 3 years ago
- Load file-backed memory☆122Updated 3 years ago
- TalariaDB is a distributed, highly available, and low latency time-series database for Presto☆123Updated 2 years ago
- Examples for Dragonboat☆193Updated last year
- A key value storage example powered by hashicorp raft and BadgerDB☆102Updated 7 years ago
- A simple and efficient hashmap package for Go. Open addressing, robin hood hashing, and xxh3 algorithm. Supports generics.☆221Updated 2 years ago
- Storing strings without GC overhead☆84Updated last week
- B+ tree in pure Go.☆96Updated 10 years ago
- Storage algorithms.☆38Updated 4 years ago
- ☆80Updated 4 months ago
- Simply ACID* key-value database. At the medium or even low latency it tries to provide greater throughput without losing the ACID propert…☆39Updated 2 weeks ago
- A memory allocator for Go.☆87Updated 5 years ago
- A Go library for an efficient implementation of a skip list: https://godoc.org/github.com/MauriceGit/skiplist☆293Updated 2 years ago