yottaStore
bbolt
yottaStore | bbolt | |
---|---|---|
9 | 18 | |
79 | 7,668 | |
- | 2.0% | |
1.8 | 9.0 | |
about 1 year ago | 7 days ago | |
Go | ||
MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
yottaStore
- Ask HN: Why are there no open source NVMe-native key value stores in 2023?
-
How to deal with overflowing counters?
I'm building a database, and I'm working on the storage format. For each record I have a logical clock which increases by 1 every time there's a write operation on the record, and I would like to be able to compare the clocks of two writes to understand which happened first.
-
Need help porting a wait free trie from C to Rust (and other silly questions)
If you're curious to know more, the tree is used for rendezvous based routing, as used by my datastore. I'm doing machine learning on a 200 TB dataset, using around 200 machines.
-
Looking for fast, space-efficient key-lookup
I copied this approach from several papers, with some improvements, for my datastore.
-
How to handle hundreds of routes?
I have a server with hundreds of routes, representing all the possible operations I can do on a datastore. How can I organize my code better?
-
Async-rdma v0.4.0: A Rust lib for writing high-throughput, low-latency networking apps simply
Yes I'm building a database where storage and compute are decoupled. I use io_uring to do pseudo-RDMA, and I'm looking to add ePBF to make it even more effective.
-
Avoid hash flooding without a secret key?
I'm currently building an implementation of the dynamo paper, yottastore. Imagine it as a huge, distributed, hash map.
-
How to deal with a very big hash table?
I'm building an implementation of the dynamo paper, yottastore. Given a key, I need to find which NVMe block stores the data. To do that I hash the key to find the shard where I have an in memory array in which at position [hash] I can find a struct with:
-
Golang is better than Rust for next generation in-memory database
I have to be honest, I'm very skeptical about your results and your code. I'm building a database, yottastore, both in javascript, golang and rust so I think I can share my opinion:
bbolt
-
How to extract key-value versioning from BBoltDB in ETCD as a Go Code
Based on this [GitHub document](https://github.com/etcd-io/bbolt) for BBoltDB, we can understand that Go Code be used to create a BBoltDB database on the system. The key-values added & operations done on them in that Go Code are stored in the BBoltDB database.
-
Locker: Store secrets on your local file system.
A Locker is a store on your file system (built on top of the amazing bbolt).
-
Looking for fast, space-efficient key-lookup
- bbolt for storage on disk. In order to get the smallest db file size possible make sure you insert the keys in order and set:
- is it possible to create a social media with all apis without database saving all the data into a yml or a json?
-
BoltDB performance hit with large values?
I'm wanting to store some wasm modules (as []byte) in BoltDB. Right now the modules are <1MB, but eventually, they could be 10-50MB in size. Is this going to reduce the performance of BoltDB all around, if the size of a value is this large? If it makes a difference, I'm using the Storm toolkit for querying.
-
Open Source Databases in Go
bbolt - An embedded key/value database for Go.
-
Help to learn multithreading in Go
For learning goroutines and channels, I usually recommend writing a program that reads from files and writes the data in a dummy database with something like https://github.com/etcd-io/bbolt. It's relatively simple and you're more likely to run into common manifestations of concurrency issues running disk operations.
-
[Noob] Question about Channels
If you would like to explore usage of channels, I highly recommend writing a program that reads from files and writes the data in a dummy database with something like https://github.com/etcd-io/bbolt.
-
A tiny NoSQL database
No transactions, no consistency guarantees, no benchmarks, global locks in the storage implementation, a collection is copied in its entirety on every insertion to it...I realize it's not for the same use case as MySQL or MongoDB, but a more obvious comparison here is e.g. https://github.com/etcd-io/bbolt. So why should someone use this over bbolt?
-
A pure Go embedded SQL database
use go-sqlite3 to work with sqlite3 is one choice.
https://github.com/etcd-io/bbolt is another pure go option.
cznic seems like an alternative to bbolt. nice to have some options.
What are some alternatives?
solid_cache - A database-backed ActiveSupport::Cache::Store
badger - Fast key-value DB in Go.
async-rdma - Easy to use RDMA API in Rust async
bolt
cdb - A native golang implementation of cdb (http://cr.yp.to/cdb.html)
goleveldb - LevelDB key/value database in Go.
KVRocks - RocksDB compatible key value store and MyRocks compatible storage engine designed for KV SSD
go-sqlite - Low-level Go interface to SQLite 3
ssd-nvme-database - Columnar database on SSD NVMe
buntdb - BuntDB is an embeddable, in-memory key/value database for Go with custom indexing and geospatial support
uNVMe - KV and LBA SSD userspace NVMe driver
BigCache - Efficient cache for gigabytes of data written in Go.