goleveldb
noms
DISCONTINUED
Our great sponsors
goleveldb | noms | |
---|---|---|
15 | 11 | |
5,993 | 7,502 | |
- | - | |
0.0 | 1.9 | |
4 months ago | over 2 years ago | |
Go | Go | |
BSD 2-clause "Simplified" License | Apache License 2.0 |
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.
goleveldb
-
Looking for fast, space-efficient key-lookup
Looks like a job for GoLevelDB.
-
Open Source Databases in Go
goleveldb - Implementation of the LevelDB key/value database in Go.
- A Database for 2022
-
An IndexedDB clone in pure Go
I wanted to get deeper insights into both indexeddb and leveldb, so decided to write an indexeddb wrapper around goleveldb.
-
What type of software do you write at your workplace?
https://github.com/syndtr/goleveldb for heavy-duty local data storage.
-
Embedded write-heavy on-disk cache, write-amplification
We're using go-leveldb for a reasonably high-load case here at my $dayjob.
-
Best way to store logs?
I would used some embedded kv store like go-leveldb or bolt. Key is BigEnding timestamp + optional tail to allow duplicate timestamps.
-
Memory leack (?) with pprof on graphql server
I'm using the leveldb https://github.com/syndtr/goleveldb for the moment because I'm developing the architecture. Mh, leveldb support the only the inmem db? :/
- IceFireDB:Distributed disk storage database based on Raft and Redis protocol.
- https://np.reddit.com/r/programming/comments/p7a56u/icefiredbdistributed_disk_storage_database_based/h9i9j44/
noms
-
I was wrong. CRDTs are the future
I am. But i know very little about CRDTs lol, so we'll see how that goes. I'm interested in converting some immutable, local-first data warehouse tooling i enjoy to a CRDT version. Prior it was more.. Git-like. Basically just Git with data structures inspired-massively from Noms[1].
The thing i've found most interesting is it appears[2] that CRDT backends need to expose CRDT flavored types to users. Which is to say how i'm writing this combines the notion of a type, say `[i32]` with how you want the merges to work. CRDT works great but based on my amateur-hour researching on the subject i don't feel you can write a single CRDT merge strategy for a single data type ala `[i32]` and have it be always correct. Applications need to indicate enough context on what makes sense for a given data type.
So yea, i agree with you. I'm interested in making a database-like thing, backed by CRDTs, but i also have seen very few general purpose implementations with CRDTs. It feels like i'm breaking "new ground", while having no idea what i'm doing and having no intention of being an actual researcher here. I'm just making apps i enjoy heh.
- Building a decentralized database
-
Picking low-hanging memory usage bugs of an open source database
Most of the changes are in the noms package which used to live in a separate repo (https://github.com/attic-labs/noms), but Dolt has since adopted them.
-
Downsides of Offline First
Not much more to say other than Noms was my favorite project (https://github.com/attic-labs/noms) for a while until acquisition and the engineers are now the ones behind Replicache (https://replicache.dev/).
I think this is going to be the next "Realm" that works everywhere.
- calling Format() on a time struct in a golang program changes the default Location's timezone information in the rest of the program
-
Steps to build Database System from sratch?
The storage layer based on Noms: https://github.com/attic-labs/noms
-
Dolt is Git for Data: a SQL database that you can fork, clone, branch, merge
Noms might be what you’re looking for (https://github.com/attic-labs/noms). Dolt is actually a fork of Noms.
-
CondensationDB: Build secure and collaborative apps [open-source]
People that are interested in a similar feature set should check out https://github.com/attic-labs/noms and the SQL fork of Noms, https://github.com/dolthub/dolt
-
Distributed search engines using BitTorrent and SQLite
With respect to IPFS and Merkle Search Trees, can anyone "in the know" comment on how they're materially different than Probabilistic B-Trees as defined by Noms[1] and Dolt[2]? I've been playing a lot with the Noms variant (Prolly Trees) lately and have often wondered where they differ from IPFS-ish Merkle Search Trees. If at all.
[1]: https://github.com/attic-labs/noms/blob/master/doc/intro.md#...
What are some alternatives?
badger - Fast key-value DB in Go.
bolt
bbolt - An embedded key/value database for Go.
buntdb - BuntDB is an embeddable, in-memory key/value database for Go with custom indexing and geospatial support
Tile38 - Real-time Geospatial and Geofencing
kingshard - A high-performance MySQL proxy
rqlite - The lightweight, distributed relational database built on SQLite.
dat - Go Postgres Data Access Toolkit
dolt - Dolt – Git for Data
ledisdb - A high performance NoSQL Database Server powered by Go
BTrDB - Berkeley Tree Database (BTrDB) server
sql-migrate - SQL schema migration tool for Go.