원문정보
초록
영어
Data-intensive applications, such as data mining and data visualization, need to deal with huge amount of data. Service-oriented architecture, on the other hand, offers a scalable and flexible framework to implement loosely-coupled and standards-based distribute computing which the data-intensive applications usually require. In this paper, we apply four kinds of data-flow constructs, namely Map Construct, Reduce Construct, Conditional Construct and Loop Construct, to assist Web services composition to process huge volume of data. Furthermore, we put forward the approach to the composition of Web services based on the I/O operation ratio, in which the CPU intensive Web services and the I/O intensive ones are arranged to execute in parallel as far as possible. A case is presented finally to show that our approaches are feasible and effective.
목차
1. Introduction
2. Related Work
3. Service Composition with Data-flow Constructs
3.1. Map Construct
3.2. Reduce Construct
3.3. Conditional Construct
3.4. Loop Construct
4. Parallel Web Services Based on I/O Operation Ratio
5. Case Studies
6. Conclusion
Acknowledgments
References
키워드
저자정보
참고문헌
- 1Composing Data-Driven Service Mashups with Tag-Based Semantic Annotations네이버 원문 이동
- 2A MapReduce-Enabled Scientific Workflow Composition Framework네이버 원문 이동
- 3Optimizing Web Service Composition for Data-intensive Applicationsearticle 원문 이동
- 4(Reference title not available)
- 5Handbook of Cloud Computing네이버 원문 이동
- 6Enabling Advanced Loading Strategies for Data Intensive Web Services네이버 원문 이동
- 7Optimizing Web Service Composition in Parallel네이버 원문 이동
- 8Towards minimizing cost for composite data-intensive services네이버 원문 이동
- 9(Reference title not available)
- 10A Petri Net-Based Method for Data Validation of Web Services Composition네이버 원문 이동