Spatio-Temporal-Lab / elfLinks
☆44Updated last year
Alternatives and similar repositories for elf
Users that are interested in elf are comparing it to the libraries listed below
Sorting:
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- ☆54Updated last year
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- Parallel Balanced Binary Tree Structures☆120Updated 7 months ago
- HOT - Height Optimized Trie☆156Updated 7 years ago
- "GraphOne: A Data Store for Real-time Analytics on Evolving Graphs", Usenix FAST'19☆60Updated 4 years ago
- ☆53Updated 11 months ago
- ☆12Updated 3 years ago
- ☆30Updated 6 years ago
- ☆15Updated 5 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Updated 3 years ago
- ☆11Updated last year
- Chimp: Efficient Lossless Floating Point Compression for Time Series Databases☆38Updated last year
- Simple baselines for "Learned Indexes"☆158Updated 7 years ago
- ☆16Updated 4 years ago
- A read-optimized learned index for unsorted data☆32Updated 2 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- LSM-trie☆114Updated 4 years ago
- ☆74Updated last month
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Scalable Hashing on Persistent Memory☆194Updated last year
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- Graphs analytics on collections of views!☆35Updated last year
- ☆15Updated 9 months ago
- An adaptive radix tree for efficient indexing in main memory.☆166Updated last year
- A fast approximate membership query data structure☆11Updated last year
- Persistent Bloom Filter☆12Updated 7 years ago