hcho3 / skiplist_cudaLinks
A parallel (CUDA) implementation of skiplist
☆15Updated 6 years ago
Alternatives and similar repositories for skiplist_cuda
Users that are interested in skiplist_cuda are comparing it to the libraries listed below
Sorting:
- AVX512F and AVX2 versions of quick sort☆104Updated 7 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Simple baselines for "Learned Indexes"☆158Updated 7 years ago
- Parallel Balanced Binary Tree Structures☆119Updated 6 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆57Updated 3 years ago
- GPU B-Tree with support for versioning (snapshots).☆51Updated 11 months ago
- ☆38Updated 5 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆31Updated 6 months ago
- ☆54Updated last year
- A Benchmark of Minimal Perfect Hash Function Algorithms.☆38Updated 2 years ago
- GPUfs - File system support for NVIDIA GPUs☆97Updated 6 years ago
- A fast and highly scalable GPU dynamic memory allocator☆109Updated 10 years ago
- ☆15Updated 5 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Code and results for our paper "Analyzing Vectorized Hash Tables Across CPU Architectures" @ VLDB '23.☆26Updated last year
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- Themis MapReduce and TritonSort☆11Updated 7 years ago
- Fast AVX512 (AVX-512) quicksort + bitonic sort.☆28Updated 3 years ago
- GraphMat graph analytics framework☆102Updated 2 years ago
- ☆16Updated 11 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- Fast differential coding functions (using SIMD instructions)☆55Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- Fast in-place radix sort with STL-like API☆48Updated 8 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago