Re: [ANN] Khepri 0.2.1 - A tree-like replicated on-disk database library
Frank Muller <[email protected]> Thu, 3 Mar 2022 00:12:49 +0100
| Newsgroups | gmane.comp.lang.erlang.general |
|---|---|
| Message-ID | <CAFA6GnD5Ccg5ksq+1Bu-M-9gUa-Q1uO4EYVjdr082fwNFDA8tQ@mail.gmail.com> |
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. [email protected]> 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 >