multiversion-concurrency-control
hyperapp
Our great sponsors
multiversion-concurrency-control | hyperapp | |
---|---|---|
19 | 18 | |
67 | 19,023 | |
- | - | |
7.3 | 2.9 | |
4 months ago | 3 months ago | |
Java | JavaScript | |
- | 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.
multiversion-concurrency-control
-
Statelines - an idea for representing asynchronicity elegantly
The code is in this repository https://github.com/samsquire/multiversion-concurrency-control in MultiplexingThread.java and MultiplexProgramParser.java
-
CRDT-richtext: Rust implementation of Peritext and Fugue
https://github.com/samsquire/multiversion-concurrency-contro...
And I implemented a 3 way text diff with myers algorithm based on https://blog.jcoglan.com/2017/02/12/the-myers-diff-algorithm...
https://github.com/samsquire/text-diff
I implemented an eventually consistent mesh protocol that uses timestamps to provide last write wins
-
A collection of lock-free data structures written in standard C++11
I think I lean towards per-thread sharding instead of mutex based or lock free data structures except for lockfree ringbuffers.
You can get embarassingly parallel performance if you split your data by thread and aggregate periodically.
If you need a consistent view of your entire set of data, that is slow path with sharding.
In my experiments with multithreaded software I simulate a bank where many bankaccounts are randomly withdrawn from and deposited to. https://github.com/samsquire/multiversion-concurrency-contro...
I get 700 million requests per second due to the sharding of money over accounts.
- How to get started?
-
The “Build Your Own Database” book is finished
If you want some sample code to implement MVCC, I implemented MVCC in multithreaded Java as a toy example
https://github.com/samsquire/multiversion-concurrency-contro...
First read TransactionC.java then read MVCC.java
-
Let's write a setjmp
I wrote an unrolled switch statement in Java to simulate eager async/await across treads.
https://github.com/samsquire/multiversion-concurrency-contro...
The goal is that a compiler should generate this for you. This code is equivalent to the following:
task1:
-
Structured Concurrency Definition
https://doc.rust-lang.org/book/ch16-00-concurrency.html
I've been working on implementing Java async/await state machine with switch statements and a scheduling loop. If the user doesn't await the async task handle, then the task's returnvalue is never handled. This is similar to the Go problem with the go statement.
https://github.com/samsquire/multiversion-concurrency-contro...
If your async call returns a handle and
- Are there any languages with transactions as a first-class concept?
-
Small VMs and Coroutines
yield value2++
https://github.com/samsquire/multiversion-concurrency-contro...
I am still working on allowing multiple coroutines to be in flight in parallel at the same time. At the moment the tasks share the same background thread.
I asked this stackoverflow question regarding C++ coroutines, as I wanted to use coroutines with a thread pool.
https://stackoverflow.com/questions/74520133/how-can-i-pass-...
-
Hctree is an experimental high-concurrency database back end for SQLite
This is very interesting. Thank you for submitting this and thank you for working on this.
I am highly interested in parallelism and high concurrency. I implemented multiversion concurrency control in Java.
https://github.com/samsquire/multiversion-concurrency-contro...
I am curious how to handle replication with high concurrency. I'm not sure how you detect dangerous reads+writes to the same key (tuples/fields) across different replica machines. In other words, multiple master.
I am aware Google uses truetime and some form of timestamp ordering and detection of interfering timestamps. But I'm not sure how to replicate that.
I began working on an algorithm to synchronize database records, do a sort, then a hash for each row where hash(row) = hash(previous_row.hash + row.data)
Then do a binary search on hashes matching/not matching. This is a synchronization algorithm I'm designing that requires minimal data transfer but multiple round trips.
The binary search would check the end of the data set for hash(replica_a.row[last]) == hash(replica_b.row[last]) then split the hash list in half and check the middle item, this shall tell you which row and which columns are different.
hyperapp
-
VanJS (Vanilla JavaScript): smallest reactive UI framework
Please check out https://github.com/jorgebucaran/hyperapp
- Show HN: Dak – a Lisp like language that transpiles to JavaScript
-
Espresso.js – minimal React alternative – is now a decade old
The likely reason it never caught on, is that it has similar pitfalls as Backbone:
- manually attaching DOM elements to view controllers
- manually attaching child views
- models which have to be wired individually via .listenTo
- possibility of infinite loops if the events accidentally recurse
A better tiny alternative would be hyperapp[1] or even Preact, that has a similar bundle size.
[1] https://github.com/jorgebucaran/hyperapp
-
How hard is it to get a Mid FE position without any commercial framework experience?
If they're focused on performance and bundle size, it's your chance to try some minimalistic exotic stuff like hyperapp (https://github.com/jorgebucaran/hyperapp) or mithril (https://mithril.js.org/) Just for fun
-
AlpineJS
With a bit of a deadline (due to a mixture of procrastination and confidence that Vue would work) I needed something quick. I have also used Hyperapp in the past but that looks like a dead project right now (although arguably it has all the functionality you need so why keep developing it?).
-
What I learned working with a senior engineer as a new grad
I’m glad it left that impression! My thoughts have clarified a bit since I read that post, and I think what I describe is more declarative, like React. But the best places to read about it (for web devs) are in Elm!
There is also this new thing I found that seems to really lean into the core of what being functional means here: https://github.com/jorgebucaran/hyperapp
After a while, you see that basically all systems can be modeled as event-driven, functional systems. It’s a flexible model, and fits beautiful into web dev where the semantics are very clear: the system is the web app and events are clicks, keyboard events, asynchronous calls...
-
Best JS library/bundler combo for ABSOLUTE MINIMUM production build size possible
Hyperapp is 1kb.
-
What's your favorite frontend framework?
- Hyperapp (https://github.com/jorgebucaran/hyperapp) - Preact - Svelte - React / Vue
-
Divergent States in a "Single Source of Truth" Framework
I'll tell you what I've learnt from struggling with a bug that made me lose a couple of weeks. The application framework used in this post is Hyperapp, but I guess the same problem can be found in frameworks based on transforming the state of "Single Source of Truth" with pure functions (such as Elm, Redux, so on) if we use them in a wrong way.
-
Popular 'coa' NPM library hijacked to steal user passwords
Personally, I try my best to avoid bringing in dependencies as much as possible, and try to limit my exposure to only dependencies with low/shallow transitive dependency counts. Unfortunately, this is pretty hard, especially in corporate settings. What we need more of are the opposite of what we've been collectively praising: we need more monolithic packages. Case in point: lodash.template is currently vulnerable with no mitigation, even though lodash itself is not. That's just sloppy publishing practices. Esbuild is a great start over the webpack/babel maze of dependencies. There's a stdlib effort along those lines that hopefully would also help. There's a bunch of micro-frameworks that are used in production just fine and have little to no dependencies.
What are some alternatives?
electric - Local-first sync layer for web and mobile apps. Build reactive, realtime, local-first apps directly on Postgres.
Preact - ⚛️ Fast 3kB React alternative with the same modern API. Components & Virtual DOM.
glibc - GNU Libc
tape - tap-producing test harness for node and browsers
tree-flat - TreeFlat is the simplest way to build & traverse a pre-order Tree in Rust
DalekJS - [unmaintained] DalekJS Base framework
marisa-trie - MARISA: Matching Algorithm with Recursively Implemented StorAge
riot - Simple and elegant component-based UI library
pybktree - Python BK-tree data structure to allow fast querying of "close" matches
solid - A declarative, efficient, and flexible JavaScript library for building user interfaces. [Moved to: https://github.com/solidui/solid]
abseil-cpp - Abseil Common Libraries (C++)
Alpine.js - A rugged, minimal framework for composing JavaScript behavior in your markup.