dialtr / libcount
C/C++ Implementation of the HyperLogLog++ cardinality estimation algorithm.
☆26Updated last year
Alternatives and similar repositories for libcount:
Users that are interested in libcount are comparing it to the libraries listed below
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆51Updated last year
- Benchmark Intel TSX (Transactional Synchronization Extension) Hardware Transactional Memory on my sandbox☆23Updated 10 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- C++ implementation of HyperLogLog☆57Updated 8 months ago
- Stasis is a flexible transactional storage library that is geared toward high-performance applications and system developers. It supports…☆53Updated 12 years ago
- ☆49Updated 4 years ago
- Linear vs binary search benchmark☆40Updated 5 years ago
- A benchmark of some prominent C/C++ hash table implementations☆37Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆48Updated 3 years ago
- ☆16Updated 4 years ago
- A low level, low latency library, which can be used to accelerate network messages using shared memory and RDMA☆74Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- A Scalable, Portable, and Memory-Efficient Lock-Free FIFO Queue (DISC '19)☆55Updated last year
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- C++ implementation of Concise and WAH compressed bitsets☆20Updated 7 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- A tiny library to send file descriptors across processes☆168Updated 7 years ago
- ☆12Updated 6 years ago
- A single file C++17 header-only Minimal Acyclic Subsequential Transducers, or Finite State Transducers☆54Updated 2 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 5 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated 2 years ago
- C++ implementation of concurrent Binary Search Trees☆72Updated 9 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Simple C++ code to benchmark fast division algorithms☆47Updated 3 years ago
- Persistent memory allocator for data-centric analytics☆54Updated 3 weeks ago
- High-performance multicore-scalable data structures and benchmarks☆139Updated 5 years ago
- Cross-platform atomic operations and lock algorithm library☆97Updated 6 years ago
- Fast wait-free algorithms designed for shared memory systems☆45Updated 6 years ago