Dynamic Load Balanced Join Processing
| dc.contributor.author | Tan K L | en_US |
| dc.contributor.author | Lu Hongjun | en_US |
| dc.date.accessioned | 2004-10-21T14:28:52Z | en_US |
| dc.date.accessioned | 2017-01-23T06:59:57Z | |
| dc.date.available | 2004-10-21T14:28:52Z | en_US |
| dc.date.available | 2017-01-23T06:59:57Z | |
| dc.date.issued | 1993-10-01T00:00:00Z | en_US |
| dc.description.abstract | In this paper, we revisit the problem of processing joins in shared-nothing systems. In such systems, a join query is usually split into a set of tasks that are allocated to the nodes in the system where the tasks could be executed concurrently and independently. While parallel processing could greatly reduce the completion time of a join operation, the system performance may degrade because of load imbalance across the nodes caused by data skewness in the relations. Most of the previous studies addressed this issue by static load balancing. We proposed here two dynamic load balancing join strategies and compared their performance with two static algorithms. The result of our study shows that dynamically balancing the join load is not only feasible but also provides good system performance. | en_US |
| dc.format.extent | 180224 bytes | en_US |
| dc.format.mimetype | application/postscript | en_US |
| dc.identifier.uri | https://dl.comp.nus.edu.sg/xmlui/handle/1900.100/1321 | en_US |
| dc.language.iso | en | en_US |
| dc.relation.ispartofseries | TR30/93 | en_US |
| dc.title | Dynamic Load Balanced Join Processing | en_US |
| dc.type | Technical Report | en_US |