Sable / HorsePowerLinks
Optimizing database queries with array programming
☆18Updated 4 years ago
Alternatives and similar repositories for HorsePower
Users that are interested in HorsePower are comparing it to the libraries listed below
Sorting:
- LLVM-jitted bitmaps☆27Updated 5 years ago
- A SQL-to-native-code compiler based on LLVM☆48Updated 9 years ago
- In-memory, columnar, arrow-based database.☆47Updated 2 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 7 years ago
- Memory Management ToolKit☆35Updated last month
- The array hash table, array burst trie and array BST, written in C, as described in my PhD thesis.☆42Updated 8 years ago
- Implementation of the JSON semi-index described in the paper "Semi-Indexing Semi-Structured Data in Tiny Space"☆57Updated 12 years ago
- MlpIndex - Extremely fast ordered index via memory level parallelism☆12Updated 6 years ago
- Detailed experiments over simdjson for VLDB article (2019) and future work☆21Updated 4 years ago
- SIMD recipes, for various platforms (collection of code snippets)☆49Updated 4 years ago
- The current backend of DBToaster, implemented in Scala.☆64Updated 3 years ago
- A Parallelism Profiler with What-If analyses for Intel Threading Building Blocks (TBB) programs☆13Updated 7 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- ☆38Updated 5 years ago
- Nautilus is a lightweight tracing JIT compiler for C++☆22Updated last week
- Wren: Nonblocking Reads in a Partitioned Transactional Causally Consistent Data Store☆8Updated 7 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Dependably fast multi-core in-memory transactions☆20Updated 7 years ago
- ☆12Updated 6 years ago
- ☆20Updated 2 years ago
- A Wait-Free Universal Construct for Large Objects☆97Updated 5 years ago
- ☆12Updated 4 years ago
- ☆28Updated 4 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆54Updated last year
- A benchmark for cache efficient data structures.☆30Updated 6 years ago
- C++11 port of the PostgreSQL DBMS☆68Updated 8 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Persistent Memory Graph Database☆43Updated 2 years ago
- a small C++ lattice library☆15Updated 5 years ago
- Quickstep project☆42Updated 7 months ago