192 citations · 726 across the 22 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
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…