forked from lemire/simplebitmapbenchmark
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathREADME
More file actions
30 lines (17 loc) · 771 Bytes
/
README
File metadata and controls
30 lines (17 loc) · 771 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
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.