TU-Berlin-DIMA / OpenCL-SIMD-hashingLinks
This repository contains our work on efficient SIMD vectorization methods for hashing in OpenCL. It was first published at the 21th International Conference on Extending Database Technology (EDBT) in March 2018.
☆11Updated 6 years ago
Alternatives and similar repositories for OpenCL-SIMD-hashing
Users that are interested in OpenCL-SIMD-hashing are comparing it to the libraries listed below
Sorting:
- Sample program for article "SIMD-ized searching in unique constant dictionary" (http://0x80.pl/articles/simd-search.html)☆52Updated 8 years ago
- ☆12Updated 6 years ago
- MonetDB as a shared library with a C API☆33Updated 3 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Efficiently Searching In-Memory Sorted Arrays:Revenge of the Interpolation Search?☆29Updated 4 years ago
- ☆12Updated 3 years ago
- Succinct C++☆24Updated 4 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 9 months ago
- ☆53Updated last year
- Thrift based key-value store with various storage backends, including MySQL, Berkeley DB, and LevelDB.☆16Updated 13 years ago
- A comparison between different integer set techniques☆14Updated 7 years ago
- Stream processing engine☆12Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- ☆38Updated 4 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Updated 4 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆86Updated 4 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- Learned Monotone Minimal Perfect Hashing☆27Updated 2 months ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- RWMutex for sharing of multicore machines.☆17Updated 6 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Simple baselines for "Learned Indexes"☆159Updated 7 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year