WSPRC: An Adaptive Model for Query Optimization over Web Services

Author

Peng, Dunlu ; Li, Chen ; Zhu, Feng ; Zhang, Ning

Author_Institution

Sch. of Opt.-Electr. & Comput. Eng., Univ. of Shanghai for Sci. & Technol., Shanghai, China

fYear

2009

fDate

7-8 Nov. 2009

Firstpage

347

Lastpage

351

Abstract

Query optimization over Web services is very important for data integration with Web services and has gained much attention in recent year. In this work, we propose an adaptive query optimization model for Web services, that is, Web Service Profiler-Reoptimizer-Cache (WSPRC). One of the core components of the model is Reoptimizer which is based on the adaptive greedy algorithm (A-Greedy) and analyzes the implementation of Web service query optimization process. We compare the traditional Greedy with A-Greedy from several aspects. The comparison and experimental results show that the WSPRC model and A-Greedy improve the efficiency of querying optimization over Web services.

Keywords

Web services; greedy algorithms; query processing; A-Greedy; WSPRC; Web Service Profiler-Reoptimizer-Cache; Web services; adaptive greedy algorithm; adaptive query optimization model; data integration; Adaptive optics; Algorithm design and analysis; Data engineering; Greedy algorithms; Information systems; Integrated optics; Optical computing; Optical feedback; Query processing; Web services; A-Greedy; Adaptive; WSPRC; Web service; query optimization;

fLanguage

English

Publisher

ieee

Conference_Titel

Web Information Systems and Mining, 2009. WISM 2009. International Conference on

Conference_Location

Shanghai

Print_ISBN

978-0-7695-3817-4

Type

conf

DOI

10.1109/WISM.2009.78

Filename

5369437