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: | Esquivel, J., Chan, P. |
---|---|
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 |
Similar Items
-
On resource scheduling of multi-join queries in parallel database systems
by: Tan, K.-L., et al.
Published: (2014) -
MAP-JOIN-REDUCE: Toward scalable and efficient data analysis on large clusters
by: Jiang, D., et al.
Published: (2013) -
Reverse engineering complex join queries
by: Zhang, M., et al.
Published: (2014) -
Parallel algorithms for computing temporal aggregates
by: Gendrano, Jose Alvin G., et al.
Published: (1996) -
Parallel processing
by: Banocnoc, Luis N., et al.
Published: (1990)