Publications

Filtré par type:

Regular and almost universal hashing: an efficient implementation

Renseignements PDF (arXiv) Code

On Desirable Semantics of Functional Dependencies over Databases with Incomplete Information

Renseignements PDF (arXiv)

Faster Population Counts Using AVX2 Instructions

Renseignements PDF (arXiv) Code

Efficient Integer-Key Compression in a Key-Value Store using SIMD Instructions

Renseignements PDF (arXiv) Code

SIMD Compression and the Intersection of Sorted Integers

Renseignements PDF (arXiv) Diapositives Code

SIMD Compression and the Intersection of Sorted Integers

Renseignements PDF (arXiv) Code

Faster 64-bit universal hashing using carry-less multiplications

Renseignements PDF (arXiv) Code

Consistently faster and smaller compressed bitmaps with Roaring

Renseignements PDF (arXiv) Diapositives Code Projet

Compressed bitmap indexes: beyond unions and intersections

Renseignements PDF (arXiv) Code

Better bitmap performance with Roaring bitmaps

Renseignements PDF (arXiv) Diapositives Code Projet

Multidimensional Bloom Filters

Renseignements PDF (arXiv) Code

Measuring academic influence: Not all citations are equal

Renseignements PDF (arXiv) Jeu de données

Functional dependencies with null markers

Renseignements PDF (arXiv)

Decoding billions of integers per second through vectorization

Renseignements PDF (arXiv) Diapositives Code

A General SIMD-based Approach to Accelerating Compression Algorithms

Renseignements PDF (arXiv)

Strongly universal string hashing is fast

Renseignements PDF (arXiv) Code

Time Series Classification by Class-Specific Mahalanobis Distances

Renseignements PDF (arXiv)

The universality of iterated hashing over variable-length strings

Renseignements PDF (arXiv)

Reordering Rows for Better Compression: Beyond the Lexicographic Order

Renseignements PDF (arXiv) Diapositives Code Code Code

Reordering Columns for Smaller Indexes

Renseignements PDF (arXiv)

Sorting improves word-aligned bitmap indexes

Renseignements PDF (arXiv) Code

Recursive n-gram hashing is pairwise independent, at best

Renseignements PDF (arXiv) Code

Faster retrieval with a two-pass dynamic-time-warping lower bound

Renseignements PDF (arXiv) Code

Tag-Cloud Drawing: Algorithms for Cloud Visualization

Renseignements PDF (arXiv) Diapositives Code Jeu de données

A Comparison of Five Probabilistic View-Size Estimation Techniques in OLAP

Renseignements PDF (arXiv) Diapositives Code

Slope One Predictors for Online Rating-Based Collaborative Filtering

Renseignements PDF (arXiv)