philolo1 / bitvector
This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."
☆12Updated 8 years ago
Related projects ⓘ
Alternatives and complementary repositories for bitvector
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 2 months ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆26Updated this week
- A C++ container-like data structure for storing a vector of bits with fast appending on both sides and fast insertion in the middle, all …☆21Updated 2 years ago
- A small DFA for under 16 states☆52Updated 6 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆38Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- ☆10Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- FOundation of stXXl and thriLL☆14Updated 9 months ago
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆31Updated last year
- Compact Data Structures Library☆124Updated 10 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- Parallel Self-Adjusting Computation☆11Updated 3 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- RLU resizable hash-table☆16Updated 9 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- Dynamic succinct/compressed data structures☆112Updated 6 months ago
- Universe-sliced indexes in C++.☆17Updated last year
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆30Updated 8 months ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆39Updated this week
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Succinct Data Structures for Rust☆56Updated 10 months ago
- Succinct C++☆25Updated 4 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Lace - implementation of work-stealing in C☆34Updated 7 months ago
- C++ Implementation of Zip Trees☆13Updated 2 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- ☆37Updated 4 years ago
- ☆57Updated 3 weeks ago