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...

Full description

Saved in:
Bibliographic Details
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
id oai:animorepository.dlsu.edu.ph:faculty_research-4960
record_format eprints
spelling oai:animorepository.dlsu.edu.ph:faculty_research-49602021-08-24T03:01:52Z An algorithm for resolving the join component selection problem in parallel join optimization Esquivel, J. Chan, P. 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. 2002-01-01T08:00:00Z text https://animorepository.dlsu.edu.ph/faculty_research/4025 info:doi/10.1109/ISPAN.2002.1004259 Faculty Research Work Animo Repository Parallel algorithms Bipartite graphs Multiprocessors Querying (Computer science) Relational databases Computer Sciences
institution De La Salle University
building De La Salle University Library
continent Asia
country Philippines
Philippines
content_provider De La Salle University Library
collection DLSU Institutional Repository
topic Parallel algorithms
Bipartite graphs
Multiprocessors
Querying (Computer science)
Relational databases
Computer Sciences
spellingShingle Parallel algorithms
Bipartite graphs
Multiprocessors
Querying (Computer science)
Relational databases
Computer Sciences
Esquivel, J.
Chan, P.
An algorithm for resolving the join component selection problem in parallel join optimization
description 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.
format text
author Esquivel, J.
Chan, P.
author_facet Esquivel, J.
Chan, P.
author_sort Esquivel, J.
title An algorithm for resolving the join component selection problem in parallel join optimization
title_short An algorithm for resolving the join component selection problem in parallel join optimization
title_full An algorithm for resolving the join component selection problem in parallel join optimization
title_fullStr An algorithm for resolving the join component selection problem in parallel join optimization
title_full_unstemmed An algorithm for resolving the join component selection problem in parallel join optimization
title_sort algorithm for resolving the join component selection problem in parallel join optimization
publisher Animo Repository
publishDate 2002
url https://animorepository.dlsu.edu.ph/faculty_research/4025
_version_ 1767196017427480576