192 citations · 726 across the 22 of their papers we have counts for
16 papers · 1 filter
Roaring Bitmaps: Implementation of an Optimized Software Library
Daniel Lemire, Owen Kaser, Nathan Kurz +4
Compressed bitmap indexes are used in systems such as Git or Oracle to accelerate queries. They represent sets and often support operations such as unions, intersections, differenc…
Consistently faster and smaller compressed bitmaps with Roaring
Daniel Lemire, Gregory Ssi-Yan-Kai, Owen Kaser
Compressed bitmap indexes are used in databases and search engines. Many bitmap compression techniques have been proposed, almost all relying primarily on run-length encoding (RLE)…
Better bitmap performance with Roaring bitmaps
Samy Chambi, Daniel Lemire, Owen Kaser +1
Bitmap indexes are commonly used in databases and search engines. By exploiting bit-level parallelism, they can significantly accelerate queries. However, they can use much memory,…
Compressed bitmap indexes: beyond unions and intersections
Owen Kaser, Daniel Lemire
Compressed bitmap indexes are used to speed up simple aggregate queries in databases. Indeed, set operations like intersections, unions and complements can be represented as logica…
Threshold and Symmetric Functions over Bitmaps
Owen Kaser, Daniel Lemire
Bitmap indexes are routinely used to speed up simple aggregate queries in databases. Set operations such as intersections, unions and complements can be represented as logical oper…
Reordering Rows for Better Compression: Beyond the Lexicographic Order
Daniel Lemire, Owen Kaser, Eduardo Gutarra
Sorting database tables before compressing them improves the compression rate. Can we do better than the lexicographical order? For minimizing the number of runs in a run-length en…