H. Lu and K.-L. Tan. Dynamic and Load-balanced TaskOriented Datbase Query Processing in Parallel Systems. In EDBT, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and Marek [21] describe how to account for current CPU utilization, memory usage, and I O load to perform site selection and determine degree of declustering for hash joins. None of these previous schemes consider repartitioning the join operator during execution. Wolf et al. 31] and Lu and Tan [15] describe techniques to repartition a traditional hash join at one point in time: between the build and probe phases of the join. These techniques are specific to an implementation of the hash join operator, and do not react to external load and memory pressures. Moreover, the last two papers do ....

H. Lu and K.-L. Tan. Dynamic and Load-balanced TaskOriented Datbase Query Processing in Parallel Systems. In EDBT, 1992.

....scenario. Work in [17] and [21] describes how to account for current CPU utilization, memory usage, and I O load to perform site selection and determine degree of declustering for hash joins. None of these previous schemes consider repartition11 ing the join operator during execution. In [30] and [15], the authors describe techniques to repartition a traditional hash join at one point in time: between the build and probe phases of the join. These techniques are specific to an implementation of the hash join operator, and do not consider continual, on the fly repartitioning of stream based ....

H. Lu and K.-L. Tan. Dynamic and Load-balanced TaskOriented Datbase Query Processing in Parallel Systems. In EDBT, 1992.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC