AMDComputeLibraries / morton_filter
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
☆85Updated 4 years ago
Alternatives and similar repositories for morton_filter:
Users that are interested in morton_filter are comparing it to the libraries listed below
- ☆50Updated 4 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- HOT - Height Optimized Trie☆148Updated 6 years ago
- ☆38Updated 4 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- ☆53Updated 10 months ago
- Succinct C++☆24Updated 4 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 6 months ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- Bumped Ribbon Retrieval and Approximate Membership Query☆42Updated this week
- ☆12Updated 6 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆29Updated 4 months ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 4 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 3 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆78Updated 2 years ago
- pmwcas☆136Updated last year
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- CLHT is a very fast and scalable (lock-based and lock-free) concurrent hash table with cache-line sized buckets.☆158Updated 3 years ago
- ☆12Updated 3 years ago
- A fast approximate membership query data structure☆11Updated 8 months ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 7 years ago
- An open-source BzTree implementation☆91Updated 3 years ago
- a quotient filter written in C☆84Updated 7 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 7 years ago