Effective Data Skew Handling for Parallel Sorting in Multiprocessor Database Systems
碩士 === 朝陽科技大學 === 資訊管理系碩士班 === 91 === A consensus on parallel architecture for very large database management has emerged. This architecture is based on a shared-nothing hardware organization. The computation model is very sensitive to skew in tuple distribution, however. Sorting operation is freque...
Main Authors: | Yu-Chen Huang, 黃渝臻 |
---|---|
Other Authors: | Yu-lung Lo |
Format: | Others |
Language: | zh-TW |
Published: |
2003
|
Online Access: | http://ndltd.ncl.edu.tw/handle/ufb72n |
Similar Items
-
Parallel sorting algorithms for hypercube multiprocessors /
by: Abali, Bulent
Published: (1989) -
Parallel sorting algorithms for hypercube multiprocessors /
by: Abali, Bulent
Published: (1989) -
PSUsort: A Parallel External Sort for a Shared Memory Multiprocessor System
by: Ramamoorthy, Sujata V.
Published: (1995) -
An approximate load balancing parallel hash join algorithm to handle data skew in a parallel data base system
by: Geum, Seong
Published: (2006) -
HIERARCHICAL MODELING OF PARALLEL ALGORITHMS ON MULTIPROCESSORS: QUICK-SORT, A CASE STUDY
by: PATIL, INDIRA
Published: (2007)