Workflow
FASTER
Our great sponsors
Workflow | FASTER | |
---|---|---|
1 | 8 | |
42 | 6,199 | |
- | 3.7% | |
0.0 | 7.2 | |
almost 8 years ago | 12 days ago | |
Haskell | C# | |
BSD 3-clause "New" or "Revised" 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.
Workflow
-
Event Sourcing
I was part of that debate, I remember a rather interesting point of discussion: Is the main operation "apply" or "dedup"
Apply seems to be the common notion of event sourcing: There is a function apply that takes a state an event and yields a new state. Then, starting in an init state and iteratively applying the entire event history, boom, latest state restored.
Dedup has a lot of charm though: Run and rerun your code, if that step of your code is executed for the first time (no corresponding event in the event history) execute the step and store its result as an event in the history, however, if that step of your code is executed for the second, third time (there is a corresponding event in the event history) do not execute the step and return its result from the event in the history. The Haskell Workflow Package (https://hackage.haskell.org/package/Workflow) is a good example
Temporal follows the second approach, so "proper" Event Sourcing? You be the judge :)
FASTER
-
A MySQL compatible database engine written in pure Go
You would be surprised by performance of modern .NET :)
Writing no-alloc is oftentimes done by reducing complexity and not doing "stupid" tricks that actually work against JIT and CoreLib features.
For databases specifically, .NET is actually positioned very well with its low-level features (intrisics incl. SIMD, FFI, struct generics though not entirely low-level) and high-throughput GC.
Interesting example of this applied in practice is Garnet[0]/FASTER[1]. Keep in mind that its codebase still consist of un-idiomatic C# and you can do way better by further simplification, but it already does the job well enough.
[0] https://github.com/microsoft/garnet
[1] https://github.com/microsoft/FASTER
- FLaNK Stack 26 February 2024
- Fast persistent recoverable log and key-value store
- GitHub - microsoft/FASTER: Fast persistent recoverable log and key-value store + cache, in C# and C++.
-
FoundationDB: A Distributed Unbundled Transactional Key Value Store
A vaguely similar project that might be of interest is: https://github.com/microsoft/FASTER
It's also an "unbundled" low-level component that one could use as the foundation for a database engine or whatever. According to Microsoft, FASTER is not just "fast", but significantly faster than even some basic in-memory data structures that ship in the .NET standard library!
The downside is that it doesn't (yet) support some more advanced features like multi-server distributed mode.
However, that relative simplicity may be preferred in some scenarios...
-
Event Sourcing
Last time i looked into it there weren't that many i could find. There is https://github.com/tikv/tikv which uses rocksdb with raft. and there is faster https://github.com/microsoft/FASTER/ .
-
Experiences with Concurrent Hash Map Libraries
you could use fasterkv https://github.com/microsoft/FASTER
-
Faster A fast concurrent persistent key-value store and log, in C# and C++
FTA, https://github.com/Microsoft/FASTER/wiki/Performance-of-FAST...
What are some alternatives?
cloud-haskell - This is an umbrella development repository for Cloud Haskell
libcuckoo - A high-performance, concurrent hash table
unliftio - The MonadUnliftIO typeclass for unlifting monads to IO
parallel-hashmap - A family of header-only, very fast and memory-friendly hashmap and btree containers.
effect-monad - Provides 'graded monads' and 'parameterised monads' to Haskell, enabling fine-grained reasoning about effects.
foundationdb - FoundationDB - the open source, distributed, transactional key-value store
record - Anonymous records
plumber - A swiss army knife CLI tool for interacting with Kafka, RabbitMQ and other messaging systems.
lens-tutorial - The missing tutorial module for the lens library
tikv - Distributed transactional key-value database, originally created to complement TiDB
rio-orphans - A standard library for Haskell
Folly - An open-source C++ library developed and used at Facebook.