192 citations · 726 across the 22 of their papers we have counts for
Showing 2007 · cs.DBShow all
2 papers · 2 filters
cs.DB2007★ 21 cited
Recursive n-gram hashing is pairwise independent, at best
Daniel Lemire, Owen Kaser
Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash valu…
cs.DB2007★ 6 cited
Attribute Value Reordering For Efficient Hybrid OLAP
Owen Kaser, Daniel Lemire
The normalization of a data cube is the ordering of the attribute values. For large multidimensional arrays where dense and sparse chunks are stored differently, proper normalizati…