Including Bloom Filters in Bottom-up Optimization
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915275201314816 |
|---|---|
| author | Zeyl, Tim Cheng, Qi Pournaghi, Reza Lam, Jason Wang, Weicheng Wong, Calvin Chen, Chong Larson, Per-Ake |
| author_facet | Zeyl, Tim Cheng, Qi Pournaghi, Reza Lam, Jason Wang, Weicheng Wong, Calvin Chen, Chong Larson, Per-Ake |
| contents | Bloom filters are used in query processing to perform early data reduction and improve query performance. The optimal query plan may be different when Bloom filters are used, indicating the need for Bloom filter-aware query optimization. To date, Bloom filter-aware query optimization has only been incorporated in a top-down query optimizer and limited to snowflake queries. In this paper, we show how Bloom filters can be incorporated in a bottom-up cost-based query optimizer. We highlight the challenges in limiting optimizer search space expansion, and offer an efficient solution. We show that including Bloom filters in cost-based optimization can lead to better join orders with effective predicate transfer between operators. On a 100 GB instance of the TPC-H database, our approach achieved a 32.8% further reduction in latency for queries involving Bloom filters, compared to the traditional approach of adding Bloom filters in a separate post-optimization step. Our method applies to all query types, and we provide several heuristics to balance limited increases in optimization time against improved query latency. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2505_02994 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Including Bloom Filters in Bottom-up Optimization Zeyl, Tim Cheng, Qi Pournaghi, Reza Lam, Jason Wang, Weicheng Wong, Calvin Chen, Chong Larson, Per-Ake Databases Bloom filters are used in query processing to perform early data reduction and improve query performance. The optimal query plan may be different when Bloom filters are used, indicating the need for Bloom filter-aware query optimization. To date, Bloom filter-aware query optimization has only been incorporated in a top-down query optimizer and limited to snowflake queries. In this paper, we show how Bloom filters can be incorporated in a bottom-up cost-based query optimizer. We highlight the challenges in limiting optimizer search space expansion, and offer an efficient solution. We show that including Bloom filters in cost-based optimization can lead to better join orders with effective predicate transfer between operators. On a 100 GB instance of the TPC-H database, our approach achieved a 32.8% further reduction in latency for queries involving Bloom filters, compared to the traditional approach of adding Bloom filters in a separate post-optimization step. Our method applies to all query types, and we provide several heuristics to balance limited increases in optimization time against improved query latency. |
| title | Including Bloom Filters in Bottom-up Optimization |
| topic | Databases |
| url | https://arxiv.org/abs/2505.02994 |