arif-arman / origami-sortLinks
Implementation of Origami: A High-Performance Mergesort Framework
☆27Updated 10 months ago
Alternatives and similar repositories for origami-sort
Users that are interested in origami-sort are comparing it to the libraries listed below
Sorting:
- ☆38Updated 5 years ago
- ☆52Updated 10 months ago
- ☆30Updated 6 years ago
- An adaptive radix tree for efficient indexing in main memory.☆165Updated last year
- ☆55Updated last year
- Fast Approximate Membership Filters (C++)☆284Updated last month
- Bumped Ribbon Retrieval and Approximate Membership Query☆48Updated 3 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Cuckoo Index: A Lightweight Secondary Index Structure☆129Updated 3 years ago
- A fast approximate membership query data structure☆11Updated last year
- HOT - Height Optimized Trie☆156Updated 7 years ago
- ☆72Updated 3 weeks ago
- SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data☆11Updated 4 years ago
- Self-Tuning Adaptive Radix Tree☆30Updated 5 years ago
- Coroutine-Oriented Main-Memory Database Engine (VLDB 2021)☆250Updated 3 years ago
- Quickstep project☆42Updated 10 months ago
- High-speed Bloom filters and taffy filters for C, C++, and Java☆35Updated 2 years ago
- Order-preserving key encoder☆125Updated 5 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- InkFuse - An Experimental Database Runtime Unifying Vectorized and Compiled Query Execution.☆52Updated last year
- ☆48Updated last year
- Fast Static Symbol Table (FSST): efficient random-access string compression☆462Updated 5 months ago
- pmwcas☆138Updated 2 years ago
- An easy-to-use, header-only C++ wrapper for Linux' perf event API☆128Updated 6 months ago
- COllapsed and COmpressed trie: a data-aware compressed string dictionary☆35Updated 7 months ago
- ☆121Updated 3 years ago
- Wormhole: A concurrent ordered in-memory key-value index with O(log L) search cost (L is search key's length)☆82Updated 3 years ago
- Sequential implementation of the Rewired Memory Array.☆19Updated 6 years ago