noms
go-cache
Our great sponsors
noms | go-cache | |
---|---|---|
11 | 8 | |
7,502 | 7,805 | |
- | - | |
1.9 | 0.0 | |
over 2 years ago | 5 months ago | |
Go | Go | |
Apache License 2.0 | 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.
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#...
go-cache
-
My first package in go. An in-memory cache package useful when creating multiple instances of the cache
Why I am creating this package? There is an already existing memory cache package which creates (One Janitor for One Cache) So I am running into issues where many go routines are running in our use cases causing the application to crash due to some memory leakage in the library itself or maybe multiple timers running at same time casuing the issue. Also this is a very popular github library but just doesn't fits when I am creating many cache instances. So thought about creating one package by myself.
-
VCache vs Go-Cache
I wrote a new library called VCache (https://github.com/microup/vcache). VCahce differs from go-cache (https://github.com/patrickmn/go-cache) by using a key of type "any" instead of a key of type "string". I compared the performance of both libraries on the main operations: Add, Get, and Delete.
-
Better Cache - A Lightning Fast Caching System with Full Text Search
https://github.com/patrickmn/go-cache is a well known one. My cache module is for it's fast full text search thus I recommend only using mine if u are using a pre-set cache.
-
go-cache VS ccache - a user suggested alternative
2 projects | 2 Apr 2022
-
Implement an in-memory cache in Golang
github.com - patrickmn/go-cache
-
Log4j RCE Found
> when they went a year without a release.
Cause these libraries depend on other libraries that are probably extremely out of date at that point and have their own security vulnerabilities.
An example of a project that hasn't been dismissed as "abandoned", is https://github.com/patrickmn/go-cache because it explicitly doesnt have dependencies.
So yeah, if you have a semi-complex library, a year without a release is abandoned.
-
In-memory caching solutions
Though pretty simple but have a look at https://github.com/patrickmn/go-cache
What are some alternatives?
BigCache - Efficient cache for gigabytes of data written in Go.
groupcache - groupcache is a caching and cache-filling library, intended as a replacement for memcached in many cases.
GCache - An in-memory cache library for golang. It supports multiple eviction policies: LRU, LFU, ARC
badger - Fast key-value DB in Go.
cache2go - Concurrency-safe Go caching library with expiration capabilities and access counters
goose
go-memdb - Golang in-memory database built on immutable radix trees
rqlite - The lightweight, distributed relational database built on SQLite.
fastcache - Fast thread-safe inmemory cache for big number of entries in Go. Minimizes GC overhead
dat - Go Postgres Data Access Toolkit
dolt - Dolt – Git for Data