Abstract
In here we consider the problem of parallel execution of Join operation by a J2EE cluster. J2EE clusters are intended for coarse-grain distributed processing of multiple queries/business transactions over the Web. Thus, the possibility of using a J2EE cluster for fine-grain parallel computations (parallel Joins in our case) is intriguing and of practical interest. We have developed a new variant of the SFR algorithm for parallel computation of Cartesian Product in Join operations and proved its optimality in terms of communication/execution-time tradeoffs via a simple lower bound. Our experimental results show that despite the fact that J2EE is considered to be a platform that uses a complex interfaces and software entities, such as various types of Java beans, J2EE clusters can be efficiently used to execute Join operation in parallel.
Original language | English |
---|---|
Title of host publication | Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks |
Publisher | Institute of Electrical and Electronics Engineers (IEEE) |
Pages | 58-63 |
Number of pages | 6 |
ISBN (Print) | 0769522106 |
DOIs | |
Publication status | Published - 2004 |
Externally published | Yes |
Event | Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks - Cork, Ireland Duration: 5 Jul 2004 → 7 Jul 2004 |
Conference
Conference | Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks |
---|---|
Country/Territory | Ireland |
City | Cork |
Period | 5/07/04 → 7/07/04 |
Keywords
- Parallel Algorithms
- Cluster Computing
- J2EE
- Distributed Databases