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
- Bloom filters for C++11☆362Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- SILT: A Memory-Efficient, High-Performance Key-Value Store☆177Updated 3 years ago
- a quotient filter written in C☆86Updated 7 years ago
- HYRISE In-Memory Hybrid Storage Engine (archived, now developed in hyrise/hyrise repo)☆89Updated 7 years ago
- 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
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- OBSOLETE, contained in https://github.com/tlx/tlx - STX B+ Tree C++ Template Classes -☆215Updated 2 years ago
- Fast Approximate Membership Filters (C++)☆281Updated 7 months ago
- A clone of Google C++ B-tree code https://code.google.com/p/cpp-btree/☆87Updated 11 years ago
- An efficient trie implementation.☆255Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆162Updated last year
- General purpose C++ library for iZENECloud☆42Updated 10 years ago
- High-performance multicore-scalable data structures and benchmarks☆142Updated 6 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago
- W-TinyLFU cache C++11 header only implementation☆62Updated 6 years ago
- MemC3☆152Updated 8 years ago
- Masstree -- lockless cache-aware trie of B+ trees [experimental]☆101Updated 6 years ago
- MICA: A Fast In-memory Key-Value Store (see isca2015 branch for the ISCA2015 version)☆208Updated 9 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆166Updated 3 years ago
- C/C++ Implementation of the HyperLogLog++ cardinality estimation algorithm.☆28Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A library of inverted index data structures☆150Updated 2 years ago
- NVM key-value store API lIbrary repository.☆88Updated 11 years ago
- QSBR and EBR library☆121Updated 5 years ago
- C++11 port of the PostgreSQL DBMS☆70Updated 8 years ago
- Lock-free multithreaded memory allocation☆106Updated 8 years ago