krasun / gosqldbLinks
A key-value persistent database that supports SQL queries over B+ and LSM trees
☆30Updated 3 years ago
Alternatives and similar repositories for gosqldb
Users that are interested in gosqldb are comparing it to the libraries listed below
Sorting:
- Log-structured merge-tree☆31Updated 2 years ago
- Write Ahead Log for LSM or bitcask storage(or any append-only write).☆271Updated 6 months ago
- A simplified implementation for log structured merge tree.☆62Updated 4 years ago
- FlashDB is an embeddable, in-memory key/value database in Go (with Redis like commands and super easy to read)☆371Updated last year
- A persistent storage (in file) based using B+ tree with byte-slice keys and values☆27Updated 3 years ago
- A Bitcask (LSM+WAL) Key/Value Store written in Go.☆39Updated 6 years ago
- A slick BTree on disk based key value store implemented in pure Go☆149Updated 3 years ago
- on-disk hash table(mainly for WAL).☆29Updated last year
- Simple SQL parser☆76Updated 6 months ago
- Storage algorithms.☆38Updated 4 years ago
- LibraDB is a simple, persistent key/value store written in pure Go in less than 1000 lines for learning purposes.☆190Updated last year
- Go implementation of B plus tree☆33Updated 3 years ago
- Distributed key-value database in Go☆43Updated 4 years ago
- ☆34Updated 4 years ago
- B+ tree in pure Go.☆93Updated 10 years ago
- Easy to use distributed event bus similar to Kafka☆95Updated 3 years ago
- A pure golang SQL database for database theory research☆844Updated 3 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.☆260Updated 2 years ago
- high performance key value database written in Go. Deprecated. Use robaho/leveldb☆87Updated 2 years ago
- B-tree implementation for Go☆239Updated 3 years ago
- 使用 Go 实现一个 LSM Tree 数据库☆93Updated 3 months ago
- Fast, lock-free, arena-based Skiplist implementation in Go that supports iteration in both directions.☆42Updated 5 years ago
- "Writing An Interpreter in Go" and "Wring A Compiler in Go"☆232Updated 6 years ago
- An Adaptive Radix Tree (ART) implementation in Go☆81Updated last year
- 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…☆225Updated last year
- Write ahead log for Go.☆670Updated 8 months ago
- Fast and easy-to-use skip list for Go.☆418Updated 10 months ago
- skipmap is a high-performance, scalable concurrent sorted map based on skip-list. Up to 10x faster than sync.Map in the typical pattern.☆213Updated 11 months ago
- Implementing bplustree base on disk(kv store).☆34Updated 5 years ago
- (educational) build your own disk based KV store in Go☆240Updated last year