iwiwi / hyperloglog-hipLinks
C++ implementation of an approximate distinct counter by HIP estimator on HyperLogLog
☆14Updated 8 years ago
Alternatives and similar repositories for hyperloglog-hip
Users that are interested in hyperloglog-hip are comparing it to the libraries listed below
Sorting:
- Concurrency Control Benchmark☆48Updated last year
- FOEDUS main source code repository☆63Updated 8 years ago
- FOEDUS: Fast Optimistic Engine for Data Unification Services☆66Updated 8 years ago
- A parallelized implementation of optimized MSD radix sort for strings☆27Updated 6 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- An Implementation of Learned Indices and a Comparative Study against Traditional Index Structures☆14Updated 6 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- A reusable, extensible, and efficient C++ implementation of the Foster B-tree data structure☆15Updated 6 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- C++ fast transactional key-value storage.☆168Updated last week
- ☆38Updated 5 years ago
- A top-down/breadth-first decision diagram manipulation framework☆60Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- C++ implementation of HyperLogLog☆60Updated last year
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆30Updated 6 years ago
- Succinct C++☆24Updated 4 years ago
- LSM-trie☆114Updated 4 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- An implementation of various in-memory concurrency control protocols☆25Updated last year
- A library that provides an embeddable, persistent key-value store for fast storage.☆38Updated 6 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- A Java library for accessing NUMA (Non Uniform Memory Access) API☆16Updated 12 years ago
- Beta release of Masstree.☆442Updated last year
- A transactional main-memory database system on multicores☆104Updated 6 years ago
- Experiments in partially ordered SMR.☆48Updated 4 years ago
- Hash table with separate chaining layout☆9Updated 3 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- HOT - Height Optimized Trie☆154Updated 7 years ago