메뉴 건너뛰기




Volumn 8, Issue 8, 1997, Pages 872-883

Parallel execution of hash joins in parallel databases

Author keywords

Bushy trees; Hash filters; Hash joins; Pipelining

Indexed keywords

DIGITAL FILTERS; DISTRIBUTED DATABASE SYSTEMS; MATHEMATICAL TRANSFORMATIONS; PIPELINE PROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER); TREES (MATHEMATICS);

EID: 0031210040     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.605772     Document Type: Article
Times cited : (9)

References (38)
  • 1
    • 84976818115 scopus 로고
    • An Overview of DB2 Parallel Edition
    • May
    • C. Baru et al., "An Overview of DB2 Parallel Edition," Proc. ACM SIGMOD, pp. 460-462, May 1995.
    • (1995) Proc. ACM SIGMOD , pp. 460-462
    • Baru, C.1
  • 3
    • 0025401088 scopus 로고
    • Prototyping Bubba, a Highly Parallel Database System
    • Mar.
    • H. Boral, W. Alexander et al., "Prototyping Bubba, A Highly Parallel Database System," IEEE Trans. Knowledge and Data Eng., vol. 2, no. 1, pp. 4-24, Mar. 1990.
    • (1990) IEEE Trans. Knowledge and Data Eng. , vol.2 , Issue.1 , pp. 4-24
    • Boral, H.1    Alexander, W.2
  • 5
    • 0029360099 scopus 로고
    • Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins
    • Aug.
    • M.-S. Chen, M.-L. Lo, P.S. Yu, and H.C. Young, "Applying Segmented Right-Deep Trees to Pipelining Multiple Hash Joins," IEEE Trans. Knowledge and Data Eng., vol. 7, no. 4, pp. 656-668, Aug. 1995.
    • (1995) IEEE Trans. Knowledge and Data Eng. , vol.7 , Issue.4 , pp. 656-668
    • Chen, M.-S.1    Lo, M.-L.2    Yu, P.S.3    Young, H.C.4
  • 6
    • 0026709989 scopus 로고
    • Scheduling and Processor Allocation for Parallel Execution of Multi-Join Queries
    • Feb.
    • M.-S. Chen, P.S. Yu, and K.L. Wu, "Scheduling and Processor Allocation for Parallel Execution of Multi-Join Queries," Proc. Eighth Int'l Conf. Data Eng., pp. 58-67, Feb. 1992.
    • (1992) Proc. Eighth Int'l Conf. Data Eng. , pp. 58-67
    • Chen, M.-S.1    Yu, P.S.2    Wu, K.L.3
  • 9
    • 0026870271 scopus 로고
    • Parallel Database Systems: The Future of High Performance Database Systems
    • June
    • D.J. DeWitt and J. Gray, "Parallel Database Systems: The Future of High Performance Database Systems," Comm. ACM, vol. 35, no. 6, pp. 85-98, June 1992.
    • (1992) Comm. ACM , vol.35 , Issue.6 , pp. 85-98
    • DeWitt, D.J.1    Gray, J.2
  • 10
    • 0024902180 scopus 로고
    • On the Effect of Join Operations on Relation Sizes
    • Dec.
    • D. Gardy and C. Puech, "On the Effect of Join Operations on Relation Sizes," ACM Trans. Database Systems, vol. 14, no. 4, pp. 574-603, Dec. 1989.
    • (1989) ACM Trans. Database Systems , vol.14 , Issue.4 , pp. 574-603
    • Gardy, D.1    Puech, C.2
  • 11
    • 84976661852 scopus 로고
    • Informix Online XPS
    • May
    • B. Gerber, "Informix Online XPS," Proc. ACM SIGMOD, p. 463, May 1995.
    • (1995) Proc. ACM SIGMOD , pp. 463
    • Gerber, B.1
  • 13
    • 84976720894 scopus 로고
    • Exploiting Inter-Operator Parallelism in XPRS
    • June
    • W. Hong, "Exploiting Inter-Operator Parallelism in XPRS," Proc. ACM SIGMOD, pp. 19-28, June 1992.
    • (1992) Proc. ACM SIGMOD , pp. 19-28
    • Hong, W.1
  • 16
    • 84976665903 scopus 로고
    • Left-Deep vs. Bush Trees: An Analysis of Strategy Spaces and Its Implication for Query Optimization
    • May
    • Y.E. Ioannidis and Y.C. Yang, "Left-Deep vs. Bush Trees: An Analysis of Strategy Spaces and Its Implication for Query Optimization," Proc. ACM SIGMOD, pp. 168-177, May 1991.
    • (1991) Proc. ACM SIGMOD , pp. 168-177
    • Ioannidis, Y.E.1    Yang, Y.C.2
  • 19
    • 0027621685 scopus 로고
    • On Optimal Processor Allocation to Support Pipelined Hash Joins
    • May
    • M.-L. Lo, M.-S. Chen, C.V. Ravishankar, and P.S. Yu, "On Optimal Processor Allocation to Support Pipelined Hash Joins," Proc. ACM SIGMOD, pp. 69-78, May 1993.
    • (1993) Proc. ACM SIGMOD , pp. 69-78
    • Lo, M.-L.1    Chen, M.-S.2    Ravishankar, C.V.3    Yu, P.S.4
  • 20
    • 0026215924 scopus 로고
    • Exploiting Database Parallelism in a Message-Passing Multiprocessor
    • Sept./Nov.
    • R.A. Lorie, J.-J. Daudenarde, J.W. Stamos, and H.C. Young, "Exploiting Database Parallelism in a Message-Passing Multiprocessor," IBM J. Reserach and Development, vol. 35, nos. 5/6, pp. 681-695, Sept./Nov. 1991.
    • (1991) IBM J. Reserach and Development , vol.35 , Issue.5-6 , pp. 681-695
    • Lorie, R.A.1    Daudenarde, J.-J.2    Stamos, J.W.3    Young, H.C.4
  • 22
    • 0041499276 scopus 로고
    • Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory
    • Aug.
    • H. Lu, K.L. Tan, and M.-C. Shan, "Hash-Based Join Algorithms for Multiprocessor Computers with Shared Memory," Proc. 16th Int'l Conf. Very Large Data Bases, pp. 198-209, Aug. 1990.
    • (1990) Proc. 16th Int'l Conf. Very Large Data Bases , pp. 198-209
    • Lu, H.1    Tan, K.L.2    Shan, M.-C.3
  • 23
    • 0026826969 scopus 로고
    • Join Processing in Relational Databases
    • Mar.
    • P. Mishra and M.H. Eich, "Join Processing in Relational Databases," ACM Computing Surveys, vol. 24, no. 1, pp. 63-113, Mar. 1992.
    • (1992) ACM Computing Surveys , vol.24 , Issue.1 , pp. 63-113
    • Mishra, P.1    Eich, M.H.2
  • 24
    • 84942213584 scopus 로고
    • The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer
    • May
    • E. Omiecinski and E.T. Lin, "The Adaptive-Hash Join Algorithm for a Hypercube Multicomputer," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 3, pp. 334-349, May 1992.
    • (1992) IEEE Trans. Parallel and Distributed Systems , vol.3 , Issue.3 , pp. 334-349
    • Omiecinski, E.1    Lin, E.T.2
  • 26
    • 0026367602 scopus 로고
    • A Pipeline N-Way Join Algorithm Based on the 2-Way Semijoin Program
    • Dec.
    • N. Roussopoulos and H. Kang, "A Pipeline N-Way Join Algorithm Based on the 2-Way Semijoin Program," IEEE Trans. Knowledge and Data Eng., vol. 3, no. 4, pp. 461-473, Dec. 1991.
    • (1991) IEEE Trans. Knowledge and Data Eng. , vol.3 , Issue.4 , pp. 461-473
    • Roussopoulos, N.1    Kang, H.2
  • 28
    • 84976736061 scopus 로고
    • A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment
    • D. Schneider and D.J. DeWitt, "A Performance Evaluation of Four Parallel Join Algorithms in a Shared-Nothing Multiprocessor Environment," Proc. ACM SIGMOD, pp. 110-121, 1989.
    • (1989) Proc. ACM SIGMOD , pp. 110-121
    • Schneider, D.1    DeWitt, D.J.2
  • 29
    • 0000343198 scopus 로고
    • Tradeoffs in Processing Complex Join Queries via Hasing in Multiprocessor Database Machines
    • Aug.
    • D. Schneider and D.J. DeWitt, "Tradeoffs in Processing Complex Join Queries via Hasing in Multiprocessor Database Machines," Proc. 16th Int'l Conf. Very Large Data Bases, pp. 469-480, Aug. 1990.
    • (1990) Proc. 16th Int'l Conf. Very Large Data Bases , pp. 469-480
    • Schneider, D.1    DeWitt, D.J.2
  • 33
    • 84976745529 scopus 로고
    • Optimization of Large Join Queries: Combining Heuristics with Combinatorial Techniques
    • A. Swami, "Optimization of Large Join Queries: Combining Heuristics with Combinatorial Techniques," Proc. ACM SIGMOD, pp. 367-376, 1989.
    • (1989) Proc. ACM SIGMOD , pp. 367-376
    • Swami, A.1
  • 34
    • 84944051300 scopus 로고
    • Optimization of Large Join Queries
    • A. Swami and A. Gupta, "Optimization of Large Join Queries," Proc. ACM SIGMOD, pp. 8-17, 1988.
    • (1988) Proc. ACM SIGMOD , pp. 8-17
    • Swami, A.1    Gupta, A.2
  • 38
    • 0026852198 scopus 로고
    • On Workload Characterization of Relational Database Environments
    • Apr.
    • P.S. Yu, M.-S. Chen, H. Heiss, and S.H. Lee, "On Workload Characterization of Relational Database Environments," IEEE Trans. Software Eng., vol. 18, no. 4, pp. 347-355, Apr. 1992.
    • (1992) IEEE Trans. Software Eng. , vol.18 , Issue.4 , pp. 347-355
    • Yu, P.S.1    Chen, M.-S.2    Heiss, H.3    Lee, S.H.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.