Add cmph test results
parent
1e084cc3fb
commit
31e7309951
12
README.md
12
README.md
|
@ -96,4 +96,16 @@ The following operations need to be fast, in order of importance:
|
||||||
5. (optional) iterate users using a defined order (`getent passwd`).
|
5. (optional) iterate users using a defined order (`getent passwd`).
|
||||||
6. (optional) iterate groups using a defined order (`getent group`).
|
6. (optional) iterate groups using a defined order (`getent group`).
|
||||||
|
|
||||||
|
Preliminary results of playing with [cmph][cmph]:
|
||||||
|
|
||||||
|
BDZ: tried b=3, b=7 (default), and b=10.
|
||||||
|
|
||||||
|
* BDZ algorithm stores 1M values in (900KB, 338KB, 306KB) respectively.
|
||||||
|
* Latency for 1M keys: (170ms, 180ms, 230ms).
|
||||||
|
* Packed vs non-packed latency differences are not meaningful.
|
||||||
|
|
||||||
|
CHM retains order, however, 1M keys weigh 8MB. 10k keys are ~20x larger with
|
||||||
|
CHM than with BDZ, eliminating the benefit of preserved ordering.
|
||||||
|
|
||||||
[git-subtrac]: https://github.com/apenwarr/git-subtrac/
|
[git-subtrac]: https://github.com/apenwarr/git-subtrac/
|
||||||
|
[cmph]: http://cmph.sourceforge.net/
|
||||||
|
|
Loading…
Reference in New Issue