AMDComputeLibraries / morton_filter
A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)
☆86Updated 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
Sorting:
- ☆51Updated 5 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- ☆53Updated last year
- HOT - Height Optimized Trie☆150Updated 7 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated last year
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆79Updated 3 years ago
- a quotient filter written in C☆84Updated 7 years ago
- ☆38Updated 4 years ago
- The world's first wait-free KV store with generic durable linearizable transactions☆40Updated 3 years ago
- LSM-trie☆114Updated 4 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 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
- High-performance dictionary coding☆104Updated 8 years ago
- A persistent LSM key-value store. FloDB is designed to scale with the number of threads and memory size.☆26Updated 8 years ago
- A fast approximate membership query data structure☆11Updated 10 months ago
- Implementation of Origami: A High-Performance Mergesort Framework☆27Updated 5 months ago
- based on the work of Harald Lang when at CWI☆23Updated 5 years ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆33Updated 3 months ago
- ☆12Updated 6 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Learned Monotone Minimal Perfect Hashing☆27Updated last month
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆89Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- In memory TPC-C implementation. Used for a number of database research projects.☆38Updated 4 years ago