amplab / succinct-cpp
Succinct C++
☆25Updated 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
- ☆12Updated 6 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- simd enabled column imprints☆11Updated 7 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆28Updated 3 years ago
- This repository hosts the code used for the following paper: Claude Barthels, Ingo Müller, Konstantin Taranov, Torsten Hoefler, Gustavo A…☆10Updated 5 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ☆52Updated 9 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 5 months ago
- ☆37Updated 4 years ago
- Template Vector Library☆18Updated 3 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated 2 weeks ago
- HOT - Height Optimized Trie☆143Updated 6 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆15Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆74Updated 2 years ago
- Compact Tree Representation☆16Updated 7 years ago
- Fork of the Shore-MT storage manager used by the research project Instant Recovery☆29Updated 6 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- In-memory, columnar, arrow-based database.☆45Updated 2 years ago
- Multi-core Window-Based Stream Processing Engine☆71Updated 3 years ago
- The Cicada engine☆55Updated 7 years ago
- Code snippets for the workshop on concurrent data structure implementation.☆31Updated 12 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
- LSM-trie☆113Updated 3 years ago
- Key-Value Store for Non-Volatile Memories uDepot☆45Updated 2 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Artifact for PPoPP'18☆18Updated 2 years ago