philolo1 / bitvector
This is the official repo for the paper "A General Framework for Dynamic Succinct and Compressed Data Structures."
☆12Updated 8 years ago
Alternatives and similar repositories for bitvector:
Users that are interested in bitvector are comparing it to the libraries listed below
- Compact Data Structures Library☆124Updated 10 years ago
- 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 …☆26Updated 3 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 7 months ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A small DFA for under 16 states☆51Updated 6 years ago
- ssmem is a simple object-based memory allocator with epoch-based garbage collection☆34Updated 8 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ☆11Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- SIMDized check which bytes are in a set☆28Updated 6 years ago
- A distributed key-value cache with builtin materialized views.☆26Updated 10 years ago
- Reproducing a bug in the Glibc condition variables using TLA+☆11Updated 2 years ago
- Succinct C++☆24Updated 4 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- RLU resizable hash-table☆17Updated 9 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆43Updated 3 weeks ago
- Automatically exported from code.google.com/p/judyarray☆17Updated 9 years ago
- ☆38Updated 4 years ago
- Counting the collisions with perl hash tables per function☆12Updated 5 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Experiments with array layouts for comparison-based searching☆83Updated last year
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆152Updated 9 months ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆85Updated 4 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆31Updated 3 months ago