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 2012Show all
3 papers · 1 filter
cs.IR2012★ 232 cited
Decoding billions of integers per second through vectorization
Daniel Lemire, Leonid Boytsov
In many important applications -- such as search engines and relational database systems -- data is stored in the form of arrays of integers. Encoding and, most importantly, decodi…
cs.DB2012★ 1 cited
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…
cs.DB2012★ 23 cited
Strongly universal string hashing is fast
Owen Kaser, Daniel Lemire
We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they…