An algorithm for resolving the join component selection problem in parallel join optimization
The use of a page-level join index in parallel join optimization requires a proper sequence for accessing data pages in the form of join components. The current approach to this method involves a strategy that first retrieves those components with a high number of page joins so as to keep all proces...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Published: |
Animo Repository
2002
|
| Subjects: | |
| Online Access: | https://animorepository.dlsu.edu.ph/faculty_research/4025 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | De La Salle University |
| Summary: | The use of a page-level join index in parallel join optimization requires a proper sequence for accessing data pages in the form of join components. The current approach to this method involves a strategy that first retrieves those components with a high number of page joins so as to keep all processors busy early in the join execution. However, problems regarding conflicts with other valid reading strategies and the choice of an appropriate component whenever several of them satisfy the selection criterion have not been specifically addressed We call such conflicts the join component selection (JCS) problem. To resolve this problem, this paper proposes appropriate component retrieval strategies that will further optimize the parallel join execution. Simulation results demonstrate an improvement over the existing one. © 2002 IEEE. |
|---|