MonetDB / MonetDBLite-C
MonetDB as a shared library with a C API
☆33Updated 3 years ago
Alternatives and similar repositories for MonetDBLite-C:
Users that are interested in MonetDBLite-C are comparing it to the libraries listed below
- This repository contains our work on efficient SIMD vectorization methods for hashing in OpenCL. It was first published at the 21th Inter…☆11Updated 6 years ago
- Succinct C++☆24Updated 4 years ago
- simd enabled column imprints☆11Updated 7 years ago
- Query processing for an extremely simple, in-memory, columnar database using Apache Arrow to represent tables☆22Updated 3 years ago
- Stand-alone implementation of the progressive indexing algorithms.☆16Updated 4 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Updated 5 years ago
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆49Updated 11 months ago
- Stream processing engine☆12Updated 3 years ago
- Sample database with LLVM execution engine.☆11Updated 8 years ago
- "Byteslice: Pushing the envelop of main memory data processing with a new storage layout" (SIGMOD'15)☆25Updated 6 years ago
- C++11 library for fast fuzzy searching☆14Updated 9 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆40Updated 10 years ago
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- Query engine synthesizer based on, our domain-specific language, VOILA☆13Updated 4 years ago
- ☆12Updated 6 years ago
- Fast implementations of the scancount algorithm: C++ header-only library☆26Updated 5 years ago
- Feed-forward Bloom filters☆52Updated 13 years ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- Cuckoo Index: A Lightweight Secondary Index Structure☆130Updated 3 years ago
- C++ library to pack and unpack vectors of integers having a small range of values using a technique called Frame of Reference☆52Updated last year
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Sample implementations using Naiad☆38Updated 10 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- High-performance dictionary coding☆104Updated 7 years ago
- A compressed, sparse cuckoo filter (see https://www.vldb.org/pvldb/vol11/p1041-breslow.pdf)☆85Updated 4 years ago
- Thrift based key-value store with various storage backends, including MySQL, Berkeley DB, and LevelDB.☆15Updated 13 years ago
- Quickstep project☆42Updated 4 months ago
- Header-only vectorized, lazy-decoding, zero-copy CSV file parser☆99Updated 8 months ago