Applying Hash Filters To Improving The Execution Of Bushy Trees (1993)
| Venue: | Proceedings of the 19th International Conference on Very Large Data Bases |
| Citations: | 3 - 3 self |
BibTeX
@INPROCEEDINGS{Chen93applyinghash,
author = {Ming-syan Chen and Hui-i Hsiao and Philip S. Yu},
title = {Applying Hash Filters To Improving The Execution Of Bushy Trees},
booktitle = {Proceedings of the 19th International Conference on Very Large Data Bases},
year = {1993},
pages = {505--516}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper, we explore an approach of interleaving a bushy execution tree with hash filters to improve the execution of multi-join queries. The effect of hash filters is evaluated first. Then, an efficient scheme to determine an effective sequence of hash filters for a bushy execution tree is developed, where hash filters are built and applied based on the join sequence specified in the bushy tree so that not only is the reduction effect optimized but also the cost associated is minimized. Various schemes using hash filters are implemented and evaluated via simulation. It is experimentally shown that the application of hash filters is in general a very powerful means to improve the execution of multi-join queries, and the improvement becomes more prominent as the number of relations in a query increases. 1 Introduction In relational database systems, joins are the most expensive operations to execute. Applications involving decision support and complex objects usually have to speci...
