Pushing Down Bit Filters in the Pipelined Execution of Large Queries
We propose a new strategy to use Bit Filters for complex pipelined queries on large databases that we call Pushed Down Bit Filters. The objective of the strategy is to make use of the Bit Filters already created for upper nodes of the execution plan, in the leaves of the plan. The aim of this strategy is to reduce the traffic between the nodes of the execution plan. When traffic is reduced, the amount of CPU work is reduced and, in most of the cases, I/O is also reduced. In addition, this technique shows no degradation in cases with little effectiveness.
Unable to display preview. Download preview PDF.
- 2.Bratbergsengen, K.: Hashing methods and relational algebra operations. In: Proc. of the Conf. on Very Large Data Bases (VLDB), pp. 323–333 (1984)Google Scholar
- 3.Chan, C.-Y., Ioannidis, Y.E.: Bitmap index design and evaluation. In: Proc. of the SIGMOD Conf. on the Management of Data, pp. 355–366 (1998)Google Scholar
- 5.Gongloor, P., Patkar, S.: Hash joins: Implementation and tuning, release 7.3. Technical report, Oracle Technical Report (March 1997)Google Scholar
- 6.Graefe, G., Bunker, R., Cooper, S.: Hash joins and hash teams in microsoft sql server. In: Proceedings of the 25th VLDB Conference, August 1998, pp. 86–97 (1998)Google Scholar
- 8.Bayardo Jr., R.J., Miranker, D.P.: Processing queries for first few answers. In: CIKM, pp. 45–52 (1996)Google Scholar
- 9.Kemper, A., Kossmann, D., Wiesner, C.: Generalized hash teams for join and group-by. In: Proc. of the Conf. on Very Large Data Bases (VLDB), September 1999, pp. 30–41 (1999)Google Scholar
- 11.PostgreSQL, http://www.postgresql.org/
- 12.Schneider, D.A., DeWitt, D.J.: A performance evaluation of four parallel join algorithms in a shared-nothing multiprocessor environment. In: Proc. ACM SIGMOD, pp. 110–121 (1989)Google Scholar
- 15.Wu, M.-C., Buchmann, A.P.: Encoded bitmap indexing for data warehouses. In: Intl. Conference on Data Engineering, pp. 220–230 (1998)Google Scholar