232 citations · 2.4k across the 65 of their papers we have counts for
4 papers · 2 filters
Faster Retrieval with a Two-Pass Dynamic-Time-Warping Lower Bound
Daniel Lemire
The Dynamic Time Warping (DTW) is a popular similarity measure between time series. The DTW fails to satisfy the triangle inequality and its computation requires quadratic time. He…
Histogram-Aware Sorting for Enhanced Word-Aligned Compression in Bitmap Indexes
Owen Kaser, Daniel Lemire, Kamel Aouiche
Bitmap indexes must be compressed to reduce input/output costs and minimize CPU usage. To accelerate logical operations (AND, OR, XOR) over bitmaps, we use techniques based on run-…
Faster Sequential Search with a Two-Pass Dynamic-Time-Warping Lower Bound
Daniel Lemire
The Dynamic Time Warping (DTW) is a popular similarity measure between time series. The DTW fails to satisfy the triangle inequality and its computation requires quadratic time. He…
Pruning Attribute Values From Data Cubes with Diamond Dicing
Hazel Webb, Owen Kaser, Daniel Lemire
Data stored in a data warehouse are inherently multidimensional, but most data-pruning techniques (such as iceberg and top-k queries) are unidimensional. However, analysts need to…