288 citations
- Université du Québec à MontréalCA22 papers
- University of New BrunswickCA10 papers
- Université du QuébecCA5 papers
- Polytechnique MontréalCA4 papers
- Université LavalCA4 papers
- Carnegie Mellon UniversityUS2 papers
- Université de SherbrookeCA2 papers
- Boston UniversityUS1 paper
- Concordia UniversityCA1 paper
- Harvey Mudd CollegeUS1 paper
- Hortonworks (United States)US1 paper
- Indian Institute of Science BangaloreIN1 paper
Showing 2014Show all
3 papers · 1 filter
cs.DB2014★ 164 cited
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,…
cs.DB2014★ 14 cited
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…
cs.IR2014★ 68 cited
SIMD Compression and the Intersection of Sorted Integers
Daniel Lemire, Leonid Boytsov, Nathan Kurz
Sorted lists of integers are commonly used in inverted indexes and database systems. They are often compressed in memory. We can use the SIMD instructions available in common proce…