daniel-lemire documents

Write good papers
Education Write good papers
Sorting improves word-aligned bitmap indexes (to appear in Data & Knowledge Engineering)
Documents Sorting improves word-aligned bitmap indexes (to appear in Data & Knowledge Engineering)
nosqldbs
Documents nosqldbs
Daniel Lemire and Anna Maclachlan, Slope One Predictors for Online Rating-Based Collaborative Filtering, SIAM Data Mining (SDM'05), pp. 471-476, 2005
Documents Daniel Lemire and Anna Maclachlan, Slope One Predictors for Online Rating-Based Collaborative Filtering, SIAM Data Mining (SDM'05), pp. 471-476, 2005
Daniel Lemire, Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element. Nordic Journal of Computing, 13 (4), pages 328-339, 2006
Documents Daniel Lemire, Streaming Maximum-Minimum Filter Using No More than Three Comparisons per Element. Nordic Journal of Computing, 13 (4), pages 328-339, 2006
Tag-Cloud Drawing: Algorithms for Cloud Visualization
Technology Tag-Cloud Drawing: Algorithms for Cloud Visualization
Extracting, Transforming and Archiving Scientific Data
Technology Extracting, Transforming and Archiving Scientific Data
Compressing column-oriented indexes
Technology Compressing column-oriented indexes
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes
Technology Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes
OLAP and more
Technology OLAP and more
Faster Column-Oriented Indexes
Technology Faster Column-Oriented Indexes
Decoding billions of integers per second through vectorization
Technology Decoding billions of integers per second through vectorization
A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP
Technology A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP
La vectorisation des algorithmes de compression
Science La vectorisation des algorithmes de compression
Roaring Bitmap : June 2015 report
Technology Roaring Bitmap : June 2015 report
Recursive n-gram hashing is pairwise independent, at best
Documents Recursive n-gram hashing is pairwise independent, at best
Sorting improves word-aligned bitmap indexes
Documents Sorting improves word-aligned bitmap indexes
Reordering columns for smaller indexes
Documents Reordering columns for smaller indexes
Scale and Translation Invariant Collaborative Filtering Systems
Documents Scale and Translation Invariant Collaborative Filtering Systems
The universality of iterated hashing over variable-length strings
Documents The universality of iterated hashing over variable-length strings
Engineering fast indexes
Technology Engineering fast indexes