amplab / succinct-cppLinks
Succinct C++
☆24Updated 4 years ago
Alternatives and similar repositories for succinct-cpp
Users that are interested in succinct-cpp are comparing it to the libraries listed below
Sorting:
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- LSM-trie☆114Updated 4 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆80Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆100Updated 9 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- High-performance dictionary coding☆104Updated 8 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆90Updated 2 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆45Updated 10 months ago
- FOEDUS main source code repository☆63Updated 8 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- A Memory-efficient Graph Store for Interactive Queries☆13Updated 3 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- Multi-core Window-Based Stream Processing Engine☆72Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- The Cicada engine☆57Updated 8 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- A local cache for the Anna KVS☆25Updated 5 years ago
- ☆54Updated last year
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Accurate and Fast Evaluation of Multi-Stage Log-Structured Designs☆10Updated 9 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- ☆12Updated 6 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- ☆38Updated 5 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆175Updated 9 years ago