Search Results for author: Nathan Kurz

Found 6 papers, 6 papers with code

Faster Remainder by Direct Computation: Applications to Compilers and Software Libraries

2 code implementations5 Feb 2019 Daniel Lemire, Owen Kaser, Nathan Kurz

Currently, the remainder of the division by a constant is computed from the quotient by a multiplication and a subtraction.

Mathematical Software Performance

Stream VByte: Faster Byte-Oriented Integer Compression

6 code implementations25 Sep 2017 Daniel Lemire, Nathan Kurz, Christoph Rupp

To surpass varint-G8IU, we present Stream VByte, a novel byte-oriented compression technique that separates the control stream from the encoded data.

Roaring Bitmaps: Implementation of an Optimized Software Library

15 code implementations22 Sep 2017 Daniel Lemire, Owen Kaser, Nathan Kurz, Luca Deri, Chris O'Hara, François Saint-Jacques, Gregory Ssi-Yan-Kai

Compressed bitmap indexes are used in systems such as Git or Oracle to accelerate queries.

Databases

Faster Population Counts Using AVX2 Instructions

3 code implementations23 Nov 2016 Wojciech Muła, Nathan Kurz, Daniel Lemire

Most processors have dedicated instructions to count the number of ones in a word (e. g., popcnt on x64 processors).

Data Structures and Algorithms

Vectorized VByte Decoding

2 code implementations20 Feb 2015 Jeff Plaisance, Nathan Kurz, Daniel Lemire

We consider the ubiquitous technique of VByte compression, which represents each integer as a variable length sequence of bytes.

SIMD Compression and the Intersection of Sorted Integers

4 code implementations24 Jan 2014 Daniel Lemire, Leonid Boytsov, Nathan Kurz

We can use the SIMD instructions available in common processors to boost the speed of integer compression schemes.

Information Retrieval Databases Performance

Cannot find the paper you are looking for? You can Submit a new open access paper.