lemire / talksLinks
Random material having to do with Daniel Lemire's talks
☆32Updated last month
Alternatives and similar repositories for talks
Users that are interested in talks are comparing it to the libraries listed below
Sorting:
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆31Updated 3 years ago
- Succinct data structures in C/C++☆93Updated last year
- Fast random number generation in an interval in Python: Up to 10x faster than random.randint.☆122Updated 2 weeks ago
- A comparative, extendable benchmarking suite for C and C++ hash-table libraries.☆43Updated last year
- This small library enables acceleration of bulk calls of certain math functions on AVX and AVX2 hardware. Currently supported operations …☆86Updated 4 years ago
- A fast SIMD parser for CSV files☆159Updated 3 years ago
- Header-only vectorized, lazy-decoding, zero-copy CSV file parser☆99Updated last year
- ☆113Updated 2 years ago
- If only std::set was a DBMS: collection of templated ACID in-memory exception-free thread-safe and concurrent containers in a header-only…☆44Updated 3 months ago
- UMASH: a fast enough hash and fingerprint with collision bounds☆159Updated last month
- ☆29Updated 2 years ago
- My very own vxsort re-implemented with "modern" C++ by a complete idiot (in C++)☆31Updated this week
- Fast Approximate Membership Filters (C++)☆24Updated 4 years ago
- Transpose: SIMD Integer+Floating Point Compression Filter☆63Updated 6 years ago
- Fast Approximate Membership Filters (C++)☆289Updated 5 months ago
- Code for paper "Base64 encoding and decoding at almost the speed of a memory copy"☆205Updated 6 years ago
- Key/Value NoSQL database that utilize LSM trees☆40Updated last month
- ☆29Updated 2 months ago
- Perfect Hash Table C/C++ Library☆15Updated 5 years ago
- Effective Memory Reclamation☆63Updated 6 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆132Updated last year
- Fast, multi-reader, multi-writer, lockless data structures for parallel programming☆87Updated 2 years ago
- A C++ skip list with Python bindings. This can be used to calculate a rolling median - fast!☆50Updated this week
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 4 years ago
- Persistent memory allocator for data-centric analytics☆60Updated 3 months ago
- A C++ library for integer array compression☆30Updated 3 years ago
- How fast can we shuffle values?☆40Updated last year
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- ☆16Updated 11 years ago
- ViyaDB in-memory columnar analytical data store☆115Updated 6 years ago