hideo55 / cpp-HyperLogLogLinks
C++ implementation of HyperLogLog
☆60Updated last year
Alternatives and similar repositories for cpp-HyperLogLog
Users that are interested in cpp-HyperLogLog are comparing it to the libraries listed below
Sorting:
- Read- and latency-optimized log structured merge tree☆174Updated 13 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- MemC3☆152Updated 8 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 8 years ago
- Fast Approximate Membership Filters (C++)☆279Updated 6 months ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- A high-performance distributed shared-log for Ceph☆115Updated 5 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 years ago
- a quotient filter written in C☆85Updated 7 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Bloom filters for C++11☆359Updated 3 years ago
- Consistent Hashing data structures and algorithms for C++☆39Updated 8 years ago
- Cross-platform, multi-language implementation of multiple streaming percentile algorithms☆64Updated 2 years ago
- Read-Log-Update: A Lightweight Synchronization Mechanism for Concurrent Programming☆48Updated 9 years ago
- QSBR and EBR library☆121Updated 5 years ago
- Supersonic is an ultra-fast, column oriented query engine library written in C++☆207Updated 4 years ago
- SLOG: Serializable, Low-latency, Geo-replicated Transactions☆46Updated 2 years ago
- Implementation of Count Min Sketch in C++☆56Updated 6 years ago
- STL like container of radix tree (a.k.a. PATRICIA trie) in C++☆142Updated 2 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- ASCYLIB (with OPTIK) is a concurrent-search data-structure library with over 40 implementantions of linked lists, hash tables, skip lists…☆180Updated 7 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆163Updated 3 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- C/C++ Implementation of the HyperLogLog++ cardinality estimation algorithm.☆27Updated 2 years ago
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- Compilation of concurrent data structures with at least lock-free or wait-free properties.☆75Updated 6 years ago