multiversion-concurrency-control VS ego

Compare multiversion-concurrency-control vs ego and see what are their differences.

multiversion-concurrency-control

Implementation of multiversion concurrency control, Raft, Left Right concurrency Hashmaps and a multi consumer multi producer Ringbuffer, concurrent and parallel load-balanced loops, parallel actors implementation in Main.java, Actor2.java and a parallel interpreter (by samsquire)
Our great sponsors
  • WorkOS - The modern identity platform for B2B SaaS
  • InfluxDB - Power Real-Time Data Analytics at Scale
  • SaaSHub - Software Alternatives and Reviews
multiversion-concurrency-control ego
19 1
67 56
- -
7.3 4.0
4 months ago 3 months ago
Java OCaml
- GNU General Public License v3.0 only
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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

Posts with mentions or reviews of multiversion-concurrency-control. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2023-05-18.
  • Statelines - an idea for representing asynchronicity elegantly
    1 project | /r/ProgrammingLanguages | 6 Jun 2023
    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
    17 projects | news.ycombinator.com | 18 May 2023
    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
    7 projects | news.ycombinator.com | 10 May 2023
    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?
    3 projects | /r/ProgrammingLanguages | 25 Apr 2023
  • The “Build Your Own Database” book is finished
    5 projects | news.ycombinator.com | 22 Apr 2023
    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
    4 projects | news.ycombinator.com | 12 Feb 2023
    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
    2 projects | news.ycombinator.com | 6 Feb 2023
    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?
    4 projects | /r/ProgrammingLanguages | 20 Jan 2023
  • Small VMs and Coroutines
    3 projects | news.ycombinator.com | 19 Jan 2023
    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
    5 projects | news.ycombinator.com | 18 Jan 2023
    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.

ego

Posts with mentions or reviews of ego. We have used some of these posts to build our list of alternatives and similar projects. The last one was on 2022-07-21.
  • Ask HN: What are some 'cool' but obscure data structures you know about?
    54 projects | news.ycombinator.com | 21 Jul 2022
    Shameless plug, I also maintain an OCaml implementation of egraphs (named ego) at https://github.com/verse-lab/ego

    While the most popular implementation at the moment seems to be egg in Rust, I find that OCaml serves as a much more ergonomic environment for quickly prototyping out uses of egraphs in practice. As a bonus, ego also shares the same logical interface as egg itself, so once you've finalised your designs, you shouldn't have much trouble porting them to egg if you need the performance gains.

What are some alternatives?

When comparing multiversion-concurrency-control and ego you can also consider the following projects:

electric - Local-first sync layer for web and mobile apps. Build reactive, realtime, local-first apps directly on Postgres.

PSI - Private Set Intersection Cardinality protocol based on ECDH and Bloom Filters

glibc - GNU Libc

sdsl-lite - Succinct Data Structure Library 2.0

tree-flat - TreeFlat is the simplest way to build & traverse a pre-order Tree in Rust

us - An alternative interface to Sia

marisa-trie - MARISA: Matching Algorithm with Recursively Implemented StorAge

RVS_Generic_Swift_Toolbox - A Collection Of Various Swift Tools, Like Extensions and Utilities

pybktree - Python BK-tree data structure to allow fast querying of "close" matches

Folly - An open-source C++ library developed and used at Facebook.

abseil-cpp - Abseil Common Libraries (C++)

FusionCache - FusionCache is an easy to use, fast and robust cache with advanced resiliency features and an optional distributed 2nd level.