forked from lemire/simplebitmapbenchmark
-
Notifications
You must be signed in to change notification settings - Fork 0
samytto/simplebitmapbenchmark
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
Simple benchmark between compressed bitmap libraries in Java Author: Daniel Lemire === Copyright and licensing === The testing Java code in this benchmark is released in the public domain. Note that this says nothing about the libraries necessary to run the benchmark. === Questions === - How fast can you compute logical ORs between many bitmaps? - What is the space-speed trade-off offered by the different libraries? === Libraries being tested === - compressedbitset 0.1 - extendedset 2.2 - JavaEWAH http://code.google.com/p/javaewah/ - SparseBitmap https://github.com/lemire/sparsebitmap and http://code.google.com/p/sparsebitmap/ === How to use === Under MacOS or Linux, just execute the run.sh script. Under Windows, just execute the run.bat script.
About
Simple benchmark between compressed bitmap libraries in Java
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published