zingdle / SIGMOD2020-MonetDB-Bindex
BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)
☆10Updated 4 years ago
Alternatives and similar repositories for SIGMOD2020-MonetDB-Bindex
Users that are interested in SIGMOD2020-MonetDB-Bindex are comparing it to the libraries listed below
Sorting:
- Reducing the cache misses of SIMD vectorization using IMV☆28Updated 2 years ago
- Self-Tuning Adaptive Radix Tree☆27Updated 5 years ago
- Source code for DPTree: Differential Indexing for Persistent Memory☆61Updated 3 years ago
- SBoost is a SIMD-based C++ library enabling fast filtering and decoding of lightweight encoded data☆11Updated 3 years ago
- Sundial: A distributed OLTP database testbed.☆37Updated 4 years ago
- Tabular: Efficiently Building Efficient Indexes (VLDB 2025)☆14Updated last month
- A read-optimized learned index for unsorted data☆31Updated last year
- A query compiler for GPUs that translates relational algebra to Cuda.☆20Updated last year
- ☆21Updated 3 years ago
- Benchmarking framework for index structures on persistent memory☆88Updated last year
- A four-dimensional Analysis of Partitioned Approximate Filters☆10Updated 2 years ago
- ☆38Updated 4 years ago
- Viper: A hybrid PMem-DRAM Key-Value Store for Persistent Memory (VLDB '21)☆75Updated 3 years ago
- ☆29Updated 5 years ago
- ☆8Updated 3 years ago
- This is the code for our self-designing range filter as described in our SIGMOD'22 paper of the same name.☆13Updated 2 years ago
- ERMIA: Memory-Optimized OLTP engine for Heterogeneous Workloads (SIGMOD 2016)☆89Updated 2 years ago
- ☆68Updated last month
- Benchmarking In-Memory Index Structures☆26Updated 6 years ago
- Cost/performance analysis of index structures on SSD and persistent memory (CIDR 2022)☆36Updated 2 years ago
- ☆72Updated last month
- Deneva is a distributed in-memory database framework that supports the evaluation of various concurrency control algorithms.☆115Updated 2 years ago
- NVM Evaluation Testbed☆29Updated 6 years ago
- Nova-LSM is a component-based design of the LSM-tree using fast and high bandwidth networks such as RDMA.☆52Updated 3 years ago
- PAIO: General, Portable I/O Optimizations With Minor Application Modifications (FAST'22)☆23Updated last year
- A benchmark for serverless analytic databases.☆21Updated 7 months ago
- Quickstep project☆42Updated 6 months ago
- ☆43Updated 3 years ago
- Tiered Indexing is a general approach to improve the memory utilization of buffer-managed data structures including B+tree, Hashing, Heap…☆33Updated 3 months ago
- ☆15Updated 5 years ago