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:
- ☆55Updated last year
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 3 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆15Updated last year
- 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
- FOundation of stXXl and thriLL☆14Updated last year
- AVX512F and AVX2 versions of quick sort☆104Updated 8 years ago
- GPU B-Tree with support for versioning (snapshots).☆50Updated last year
- Succinct C++☆24Updated 5 years ago
- ☆20Updated 2 years ago
- Parallel Balanced Binary Tree Structures☆121Updated 8 months ago
- Code for paper "Engineering a High-Performance GPU B-Tree" accepted to PPoPP 2019☆57Updated 3 years ago
- A fully concurrent lock-free cuckoo hash table implementation☆56Updated 8 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Artifact for PPoPP'18☆19Updated 3 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Updated 3 months ago
- A fast and highly scalable GPU dynamic memory allocator☆110Updated 10 years ago
- Traditional data-structure designs, whether lock-based or lock-free, provide parallelism via fine grained synchronization among threads. …☆31Updated 15 years ago
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- LSM-trie☆114Updated 4 years ago
- ☆38Updated 5 years ago
- A local cache for the Anna KVS☆24Updated 5 years ago
- Lock-free parallel disjoint set data structure (aka UNION-FIND) with path compression and union by rank☆67Updated 10 years ago
- GPUfs - File system support for NVIDIA GPUs☆98Updated 7 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆32Updated 7 months ago
- An implementation of Intel's concurrent B+Tree (Palm Tree)☆176Updated 9 years ago
- Scalable Structural Index Constructor for JSON Analytics☆26Updated last year
- Codes of the paper "Speeding Up Set Intersections in Graph Algorithms using SIMD Instructions" that was published in SIGMOD 2018. Authors…☆30Updated 6 years ago