[ANN] Khepri 0.2.1 - A tree-like replicated on-disk database library

[Frank Muller]

Hi Jean-Sébastien,

Very promising. Would it be possible to test insert (50%) + delete (25%) +
update (%25) in the same time? You can vary the numbers of course.

How about “gets”? Are they faster in Khepri?

Best
F.

sebastien.pedron@REDACTED> a écrit :

> On 18/02/2022 11:21, Frank Muller wrote:
> > Do you provide (throughput / latency) benchmarks?
>
> Hi!
>
> I prepared a first micro-benchmark tool to compare Khepri and Mnesia:
> https://github.com/rabbitmq/khepri-benchmark
>
> The README explains what it measures and how it works. In particular, it
> only tests operations per second, not latency.
>
> Results are automatically published from GitHub Actions to the following
> page (though remember that the CI runner only has 2 CPU cores):
>
>
> --
> Jean-Sébastien Pédron
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://erlang.org/pipermail/erlang-questions/attachments/20220303/cbd6378f/attachment.htm>