amplab / succinct-cppLinks
Succinct C++
☆24Updated 5 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:
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Implementation of the BwTree as specified by Microsoft Research☆99Updated 9 years ago
- LSM-trie☆114Updated 4 years ago
- A Memory-efficient Graph Store for Interactive Queries☆13Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆88Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- ☆54Updated last year
- Multi-core Window-Based Stream Processing Engine☆73Updated 4 years ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆38Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆92Updated 2 years ago
- The Cicada engine☆59Updated 8 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- W-TinyLFU cache C++11 header only implementation☆63Updated 7 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 months ago
- A data structure and algorithm library built for TerarkDB☆67Updated 3 years ago
- ☆12Updated 6 years ago
- Simple baselines for "Learned Indexes"☆158Updated 7 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆36Updated 8 months ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Persistent Memory Graph Database☆44Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago