Fast Cardinality Estimation of Multi-Join Queries Using Sketches
☆16Feb 29, 2024Updated 2 years ago
Alternatives and similar repositories for fast-multi-join-sketch
Users that are interested in fast-multi-join-sketch are comparing it to the libraries listed below
Sorting:
- A new cardinality estimation scheme for join query estimation☆42Dec 6, 2024Updated last year
- A four-dimensional Analysis of Partitioned Approximate Filters☆11Aug 6, 2025Updated 7 months ago
- Source code of our implementation of the concurrent RMA☆12May 23, 2019Updated 6 years ago
- Concurrent (with OLC) Adaptive Radix Trie in Golang.☆11Jul 31, 2020Updated 5 years ago
- Grizzly: Efficient Stream Processing Through Adaptive Query Compilation☆16Jun 13, 2020Updated 5 years ago
- Code for our paper "Evaluating SIMD Compiler-Intrinsics for Database Systems"☆16Jul 5, 2023Updated 2 years ago
- ☆16Mar 16, 2021Updated 4 years ago
- ☆16Jan 24, 2025Updated last year
- A new CardEst Benchmark to Bridge AI and DBMS☆134Mar 14, 2023Updated 2 years ago
- Evaluation framework and methods for estimating cardinalities of groups of sets☆24Jul 6, 2023Updated 2 years ago
- DB for DAQ systems based on Persistent Memory and NVMe drives☆21Jun 26, 2020Updated 5 years ago
- based on the work of Harald Lang when at CWI☆23Mar 2, 2020Updated 6 years ago
- A pytorch implementation for FACE: A Normalizing Flow based Cardinality Estimator☆24Oct 5, 2023Updated 2 years ago
- Reducing the cache misses of SIMD vectorization using IMV☆29Jun 29, 2022Updated 3 years ago
- ☆35Sep 13, 2021Updated 4 years ago
- ☆34Jul 9, 2020Updated 5 years ago
- simd enabled column imprints☆11Feb 12, 2018Updated 8 years ago
- Self-Tuning Adaptive Radix Tree☆30Apr 19, 2020Updated 5 years ago
- ☆38Aug 14, 2023Updated 2 years ago
- testbed for different SIMD implementations for set intersection and set union☆41Jan 29, 2020Updated 6 years ago
- 容器管理☆10Sep 11, 2017Updated 8 years ago
- Introduction to Object-Oriented Programming in C++. Here are the notes for the NYU Tandon course CS2124.☆11Jun 6, 2021Updated 4 years ago
- ☆13May 3, 2022Updated 3 years ago
- Code used in the paper "On dynamic succinct graph representations".☆11Sep 2, 2021Updated 4 years ago
- Stream processing engine☆13Apr 7, 2021Updated 4 years ago
- ☆11Feb 21, 2023Updated 3 years ago
- SQL Optimizations using MLIR☆12Apr 5, 2020Updated 5 years ago
- ☆13Jan 21, 2022Updated 4 years ago
- ☆11Nov 3, 2021Updated 4 years ago
- [CIKM 2025] LLMAEL: Large Language Models are Good Context Augmenters for Entity Linking☆17Sep 6, 2025Updated 6 months ago
- IDLSet - Fast u64 integer set operations☆13May 30, 2024Updated last year
- Zhang Wang Fast Approximate Quantiles Algorithm in Rust☆13Jan 3, 2022Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆13Jul 7, 2025Updated 8 months ago
- BinDex: A Two-Layered Index for Fast and Robust Scans (SIGMOD2020)☆10Jun 5, 2020Updated 5 years ago
- IOManager tries to bridge the gap in existing async framework to build full async networked database/storage/keyvalue storage☆11Feb 7, 2026Updated last month
- A Database System for Research and Fast Prototyping☆114Nov 11, 2025Updated 3 months ago
- Adaptive Radix Tree in C++☆51Feb 25, 2026Updated last week
- C++ header only multi-paxos library.☆42Mar 30, 2022Updated 3 years ago
- A lightweight, LGPL-2.1 licensed C API to read from / write to S3 buckets☆12Jun 18, 2025Updated 8 months ago