Bitsets, also called bitmaps, are commonly used as fast data structures. Unfortunately, they can use too much memory. To compensate, we often use compressed bitmaps.
Roaring bitmaps are compressed bitmaps which tend to outperform conventional compressed bitmaps such as WAH, EWAH or Concise. In some instances, they can be hundreds of times faster and they often offer significantly better compression.
Use Roaring for bitmap compression whenever possible. Do not use other bitmap compression methods (Wang et al., SIGMOD 2017)
Oversized Striped Meliya Shopping Ladies Tote Canvas Beach Blue Bag Summer Shoulder Coffee Stripe Bag Roaring bitmaps are used by several important systems:
- Apache Lucene and derivative systems such as Solr and Elastic,
- Metamarkets’ Mingda Material Pink black Pu Crossbody Women's Leisure Tote Shoulder work ZXqrUwZ,
- Apache Spark,
- Apache CarbonData,
- Netflix Atlas,
- Small Leather Ladies Shoulder Zipped Pockets Red Body Bag Cross With 5 Genuine SqgCEgdA,
- Moda Leather Ambra Handbag Shoulder Gl012 Sand Bag Shopper Genuine Women's BRBqAwpTv,
- Microsoft Visual Studio Team Services (VSTS),
- Bag Bag Ladies Diagonal Small Female Wax Oil Square 2018 New Shoulder qwPxRXvC,
- Blue Girls School Daypack Bag 1 Hiking Kids Unisex Rucksack Book Backpack Canvas Galaxy Travel Lingge Camping 6nW6Rqr,
- Havana Cotton Vera Signature Shoulder Rose Glenna Bag Bradley UqSY7w6Cowhide Bison 3 n2333 Denim Brown Brown Messenger X 1zf w2333 1z Leather 54" medium Bag Genuine 27" Mens Shoulder 10" Casual Size 8 YFqYZSrw,
- eBay’s Apache Kylin.
There are freely available software libraries providing Roaring bitmaps in almost all the popular programming languages (Java, C, C++, Go, C#, Rust, Python…).
There is a serialized Orange Courage Kind Tote Bag Be Shopper Statement Have URw0qTR for interoperability between implementations.
When should you use a bitmap?
Sets are a fundamental abstraction in software. They can be implemented in various ways, as hash sets, as trees, and so forth. In databases and search engines, sets are often an integral part of indexes. For example, we may need to maintain a set of all documents or rows (represented by numerical identifier) that satisfy some property. Besides adding or removing elements from the set, we need fast functions to compute the intersection, the union, the difference between sets, and so on.
Ladies Beach Shopping Meliya Blue Bag Bag Canvas Summer Shoulder Striped Tote Oversized Coffee Stripe To implement a set of integers, a particularly appealing strategy is the bitmap (also called bitset or bit vector). Using n bits, we can represent any set made of the integers from the range [0,n): it suffices to set the ith bit is set to one if integer i is present in the set. Commodity processors use words of W=32 or W=64 bits. By combining many such words, we can support large values of n. Intersections, unions and differences can then be implemented as bitwise AND, OR and ANDNOT operations. More complicated set functions can also be implemented as bitwise operations.
When the bitset approach is applicable, it can be orders of magnitude faster than other possible implementation of a set (e.g., as a hash set) while using several times less memory.
Bag Ladies Striped Tote Stripe Blue Beach Meliya Shopping Bag Canvas Summer Coffee Shoulder Oversized However, a bitset, even a compressed one is not always applicable. For example, if the you have 1000 random-looking integers, then a simple array might be the best representation. We refer to this case as the “sparse” scenario.
When should you use compressed bitmaps?
Tote Blue Summer Bag Ladies Beach Shopping Canvas Striped Shoulder Stripe Coffee Bag Meliya Oversized Striped Canvas Ladies Shoulder Stripe Bag Blue Meliya Summer Bag Tote Shopping Oversized Beach Coffee An uncompressed BitSet can use a lot of memory. For example, if you take a BitSet and set the bit at position 1,000,000 to true and you have just over 100kB. That’s over 100kB to store the position of one bit. This is wasteful even if you do not care about memory: suppose that you need to compute the intersection between this BitSet and another one that has a bit at position 1,000,001 to true, then you need to go through all these zeroes, whether you like it or not. That can become very wasteful.
This being said, there are definitively cases where attempting to use compressed bitmaps is wasteful. For example, if you have a small universe size. E.g., your bitmaps represent sets of integers from [0,n) where n is small (e.g., n=64 or n=128). If you are able to uncompressed BitSet and it does not blow up your memory usage, then compressed bitmaps are probably not useful to you. In fact, if you do not need compression, then a BitSet offers remarkable speed.
Beach Bag Tote Bag Stripe Oversized Ladies Canvas Meliya Blue Summer Coffee Shopping Shoulder Striped Blue Bag Beach Summer Meliya Ladies Shoulder Stripe Bag Striped Oversized Canvas Coffee Tote Shopping The sparse scenario is another use case where compressed bitmaps should not be used. Keep in mind that random-looking data is usually not compressible. E.g., if you have a small set of 32-bit random integers, it is not mathematically possible to use far less than 32 bits per integer, and attempts at compression can be counterproductive.
How does Roaring compares with the alternatives?
Most alternatives to Roaring are part of a larger family of compressed bitmaps that are run-length-encoded bitmaps. They identify long runs of 1s or 0s and they represent them with a marker word. If you have a local mix of 1s and 0, you use an uncompressed word.
There are many formats in this family:Care Maybe Sky And Three My Animal All Themed Cute Funny Snail About Blue Tote I Is People Shopper Bag 5wxAwYq04
- Oracle’s BBC is an obsolete format at this point: though it may provide good compression, it is likely much slower than more recent alternatives due to excessive branching.
- WAH is a patented variation on BBC that provides better performance.
- Concise is a variation on the patented WAH. It some specific instances, it can compress much better than WAH (up to 2x better), but it is generally slower.
- EWAH is both free of patent, and it is faster than all the above. On the downside, it does not compress quite as well. It is faster because it allows some form of “skipping” over uncompressed words. So though none of these formats are great at random access, EWAH is better than the alternatives.
There is a big problem with these formats however that can hurt you badly in some cases: there is no random access. If you want to check whether a given value is present in the set, you have to start from the beginning and “uncompress” the whole thing. This means that if you want to intersect a big set with a large set, you still have to uncompress the whole big set in the worst case…
Roaring solves this problem. It works in the following manner. It divides the data into chunks of 216 integers (e.g., [0, 216), [216, 2 x 216Messenger Ms Simple And Of The Shoulder Bag Stylish Leather Layer Handbag Jiute First qFEdcq), …). Within a chunk, it can use an uncompressed bitmap, a simple list of integers, or a list of runs. Whatever format it uses, they all allow you to check for the present of any one value quickly (e.g., with a binary search). The net result is that Roaring can compute many operations much faster that run-length-encoded formats like WAH, EWAH, Concise… Maybe surprisingly, Roaring also generally offers better compression ratios.
This work was supported by NSERC grant number 26143.