Introduction to algorithms
Strategies for distributed query optimization
Information Sciences: an International Journal
Scheduling multiple queries on a parallel machine
SIGMETRICS '94 Proceedings of the 1994 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Information Sciences: an International Journal
Future Generation Computer Systems - Special issue on metacomputing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Pipeline N-Way Join Algorithm Based on the 2-Way Semijoin Program
IEEE Transactions on Knowledge and Data Engineering
Distributed Query Processing on the Grid
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Optimization of Multi-Way Join Queries for Parallel Execution
VLDB '91 Proceedings of the 17th International Conference on Very Large Data Bases
Grid Information Services for Distributed Resource Sharing
HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing
InfoGrid: providing information integration for knowledge discovery
Information Sciences—Informatics and Computer Science: An International Journal - special issue: Knowledge discovery from distributed information sources
The Grid 2: Blueprint for a New Computing Infrastructure
The Grid 2: Blueprint for a New Computing Infrastructure
Adaptive Query Processing and the Grid: Opportunities and Challenges
DEXA '04 Proceedings of the Database and Expert Systems Applications, 15th International Workshop
Join algorithm using multiple replicas in data grid
WAIM'05 Proceedings of the 6th international conference on Advances in Web-Age Information Management
Information Sciences: an International Journal
Hi-index | 0.07 |
Query processing in data grids is a difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. Applying join operations on remote relations in data grids is a unique and interesting problem. However, to the best of our knowledge, little is done to date on multi-join query processing in data grids. An approach for processing multi-join queries is proposed in this paper. Firstly, a relation-reduction algorithm for reducing the sizes of operand relations is presented in order to minimize data transmission cost among grid nodes. Then, a method for scheduling computer nodes in data grids is devised to parallel process multi-join queries. Thirdly, an innovative method is developed to efficiently execute join operations in a pipeline fashion. Finally, a complete algorithm for processing multi-join queries is given. Analytical and experimental results show the effectiveness and efficiency of the proposed approach.