gvinciguerra / BlockEpsilonTreeLinks
🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
☆11Updated 3 years ago
Alternatives and similar repositories for BlockEpsilonTree
Users that are interested in BlockEpsilonTree are comparing it to the libraries listed below
Sorting:
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- C++17 Implementation of Dynamic Filter Trie☆8Updated 3 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 5 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 3 months ago
- Learned Monotone Minimal Perfect Hashing☆27Updated 4 months ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆27Updated 5 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 2 years ago
- Succinct C++☆24Updated 4 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆10Updated 2 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆45Updated 10 months ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Succinct data structures in C/C++☆89Updated 9 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Space efficient (graph) algorithms☆18Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- similarity join and search algorithms for edit distance and jaccard☆18Updated 7 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆45Updated last month
- simd enabled column imprints☆11Updated 7 years ago
- A data structure and algorithm library built for TerarkDB☆66Updated 3 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆57Updated 2 years ago
- SUccinct Retrieval Framework☆20Updated 9 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- ☆12Updated 6 years ago
- ☆26Updated 8 years ago
- A C++ library providing fast language model queries in compressed space.☆131Updated 2 years ago