robert-sedgewick / hyperbitbit
Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits
☆10Updated last month
Related projects ⓘ
Alternatives and complementary repositories for hyperbitbit
- based on the work of Harald Lang when at CWI☆22Updated 4 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated 11 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆32Updated last year
- A General-Purpose Counting Filter: Counting Quotient Filter☆126Updated last year
- Paper about the estimation of cardinalities from HyperLogLog sketches☆61Updated 3 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 4 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆76Updated 2 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
- ☆15Updated 7 years ago
- In memory TPC-C implementation. Used for a number of database research projects.☆37Updated 4 years ago
- ☆115Updated 2 years ago
- C library to compute the Hamming weight of arrays☆44Updated 5 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆38Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆111Updated 2 weeks ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆14Updated last year
- A read-optimized learned index for unsorted data☆31Updated last year
- Learned Sort: a model-enhanced sorting algorithm☆81Updated 3 years ago
- HyperLogLogLog: Counting Distinct Elements With One Log More☆18Updated 2 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆39Updated this week
- ☆15Updated 4 years ago
- HOT - Height Optimized Trie☆140Updated 6 years ago
- An open-source framework for concurrent data-structures and benchmarks.☆64Updated last month
- ☆52Updated 6 months ago
- testbed for different SIMD implementations for set intersection and set union☆40Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆51Updated 7 years ago
- High-performance dictionary coding☆103Updated 7 years ago
- A high-performance hash-table for network packet-processing applications (compatible with DPDK)☆36Updated 6 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆27Updated 3 years ago
- Transactional Data Structure Libraries☆12Updated 6 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆30Updated 14 years ago