Distributed multi-join query processing in data grids

Information Sciences

Volumn 177, Issue 17, 2007, Pages 3574-3591

  Yang, Donghua ^a   Li, Jianzhong ^a  

^a HARBIN INSTITUTE OF TECHNOLOGY   (China)

Author keywords

Data grids; Minimum maximum edge matching; Multi join query processing; Relation reduction algorithm

Indexed keywords

ALGORITHMS; DATA COMMUNICATION SYSTEMS; DATABASE SYSTEMS; GRID COMPUTING; OPTIMIZATION;

DATA GRIDS; MINIMUM MAXIMUM EDGE MATCHING; MULTI JOIN QUERY PROCESSING; RELATION REDUCTION ALGORITHMS;

QUERY PROCESSING;

EID: 34250343731     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2007.03.001     Document Type: Article

References (16)

1. Alpdemir M.N., Mukherjee A., Paton N.W., Watson P., Fernandes A.A.A., Gounaris A., and Smith J. Service-based distributed querying on the grid. The First International Conference on Service Oriented Computing, Trento, Italy. LNCS vol. 2910 (2003), Springer-Verlag 467-482
2. G. Anastasios, W.P. Norman, S. Rizos, A.A.A. Fernandes, Adaptive query processing and the grid: opportunities and challenges, in: Proceedings of the 1st International Workshop on Grid and Peer-to-Peer Computing Impacts on Large Scale Heterogeneous Distributed Database Systems, Zaragoza, Spain, 2004, pp. 506-510.
3. Chervenak A., Foster I., Kesselman C., Salisbury C., and Tuecke S. The data grid: towards an architecture for the distributed management and analysis of large scientific datasets. Journal of Network and Computer Applications 23 (2001) 187-200
4. Cormen T.H., Leiserson C.E., Rivest R.L., and Stein C. Introduction to Algorithms (1990), MIT Press, Cambridge, MA
5. K. Czajkowski, S. Fitzgerald, I. Foster, C. Kesselman, Grid information services for distributed resource sharing, in: Proceedings of the 10th IEEE Symposium on High Performance Distributed Computing, San Francisco, 2001, pp. 181-194.
6. Fai{dotless}̈za N., and Yahya S. Extension of the one-shot semijoin strategy to minimize data transmission cost in distributed query processing. Information Sciences 114 1-4 (1999) 1-21
7. Foster I., and Kesselman C. The Grid 2: Blueprint for a New Computing Infrastructure (2003), Morgan Kaufman, San Francisco
8. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), W.H. Freeman and Company, New York
9. H. Lu, M.C. Shari, K.L. Tan, Optimization of multi-way join queries for parallel execution, in: Proceedings of the 17th International Conference on Very Large Data Bases, Barcelona, Spain, 1991, pp. 549-560.
10. Nikolaos G., Anthony R., Moustafa G., and Guo Y.K. InfoGrid: providing information integration for knowledge discovery. Information Sciences 155 3-4 (2003) 199-226
11. Roussopoulos N., and Kang H. A pipeline n-way join algorithm based on the 2-way Semijoin Program. IEEE Transactions on Knowledge and Data Engineering 3 4 (1991) 486-495
12. Segev A. Strategies for distributed query optimization. Information Sciences 54 1-2 (1991) 67-88
13. Smith J., Gounaris A., Watson P., Paton N.W., Fernandes A.A.A., and Sakellariou R. Distributed query processing on the grid. The 3rd International Workshop on Grid Computing, Baltimore, Maryland. LNCS vol. 2536 (2002), Springer-Verlag 279-290
14. J.L. Wolf, J.T. Turek, M.S. Chen, P.S. Yu, Scheduling multiple queries on a parallel machine, in: Proceedings of the ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, Nashville, Tennessee, 1994, pp. 45-55.
15. Wolski R., Spring N.T., and Hayes J. The network weather service: a distributed resource performance forecasting service for metacomputing. Future Generation Computer Systems 15 5-6 (1999) 757-768
16. Yang D.H., Li J.Z., and Rasool Q. Join algorithm using multiple replicas in data grid. The 6th International Conference on Advances in Web-Age Information Management, Hangzhou, China. LNCS vol. 3739 (2005), Springer-Verlag 416-427