Open Access
- 30 May 2026
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 227-238
Abstract
Bitmap filtering is a technique used to accelerate queries that contain hash-based joins. Beyond simple select-project-join queries, bitmap filters can also be applied to more complex query patterns, sometimes achieving performance comparable to alternative plans that query engines may not otherwise consider. At the same time, placing bitmap filters as a post-processing step after optimization can result in suboptimal choices. In this paper, we describe how local and distributed bitmap filters are integrated in the Microsoft Fabric Data Warehouse (or Fabric DW). We highlight challenges and solutions in the spaces of optimization, scheduling, and execution. We complement our presentation with an experimental evaluation over synthetic benchmarks and real data workloads that validate our approach.Keywords
This publication has 13 references indexed in Scilit:
- Query optimization in Oracle 12c database in-memoryProceedings of the VLDB Endowment, 2015
- Cuckoo Filter2014
- Optimizing Star Join Queries for Data Warehousing in Microsoft SQL Server2008
- On applying hash filters to improving the execution of multi-join queriesThe VLDB Journal, 1997
- Outerjoin simplification and reordering for query optimizationACM Transactions on Database Systems, 1997
- Volcano-an extensible and parallel query evaluation systemIEEE Transactions on Knowledge and Data Engineering, 1994
- Join and Semijoin Algorithms for a Multiprocessor Database MachineACM Transactions on Database Systems, 1984
- Query processing in a system for distributed databases (SDD-1)ACM Transactions on Database Systems, 1981
- Using Semi-Joins to Solve Relational QueriesJournal of the ACM, 1981
- Space/time trade-offs in hash coding with allowable errorsCommunications of the ACM, 1970