Performance Comparison of Pipelined Hash Joins on Workstation Clusters-Reference-Cited by-同舟云学术

Performance Comparison of Pipelined Hash Joins on Workstation Clusters

Published:2002 Issue: Volume: Page:264-275
ISSN:0302-9743
Container-title:High Performance Computing — HiPC 2002
language:
Short-container-title:

Author:

Imasaki Kenji,Nguyen Hong,Dandamudi Sivarama P.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-36265-7_25

Reference20 articles.

1. M.-S. Chen, M. Lo, P. S. Yu, and H.C. Young. Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins. IEEE Transactions on Knowledge and Data Engineering, 7(4):656–667, Aug. 1995. 266

2. Compaq Computer Corporation. Parallel Database Clusters for Oracle 8i, 2000. Available at http://www.compaq.com . 264

3. S.P. Dandamudi. Using Workstations for Database Query Operations. In International Conference of Computers and Their Applications, pages 100–105, Tempe, Arizona, Oct. 1997. 264, 265

4. S.P. Dandamudi and G. Jain. Architectures for Parallel Query Processing on Networks ofWorkstations. In International Conference of Parallel and Distributed Computing Systems, pages 444–451, New Orleans, Louisiana, Oct. 1997. 264

5. D. J. DeWitt and J. Gray. Parallel Database Systems: The Future of High-Performance Database Systems. Communications of the ACM, 35(6):85–98, June 1992. 264, 265

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Parallel Hash Join Algorithms for Dynamic Load Balancing in a Shared Disks Cluster;Computational Science and Its Applications - ICCSA 2006;2006

2. An Adaptive Load Balancing Algorithm for Large Data Parallel Processing with Communication Delay;Lecture Notes in Computer Science;2003

3. Performance Comparison of Pipelined Hash Joins on Workstation Clusters;High Performance Computing — HiPC 2002;2002