WSPRC: An adaptive model for query optimization over web services

Dunlu Peng; Chen Li; Feng Zhu; Ning Zhang

doi:10.1109/WISM.2009.78

WSPRC: An adaptive model for query optimization over web services

Dunlu Peng^*, Chen Li, Feng Zhu, Ning Zhang

^*Corresponding author for this work

Research output: Contribution to book/anthology/report/conference proceeding › Article in proceeding › Research › peer-review

1 Citation (Scopus)

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 comparision and experimental results show that the WSPRC model and A-Greedy improve the efficiency of querying optimization over Web services.

Original language	English
Title of host publication	2009 International Conference on Web Information Systems and Mining, WISM 2009
Number of pages	5
Publication date	1 Dec 2009
Pages	347-351
Article number	5369437
ISBN (Print)	9780769538174
DOIs	https://doi.org/10.1109/WISM.2009.78
Publication status	Published - 1 Dec 2009
Externally published	Yes
Event	2009 International Conference on Web Information Systems and Mining, WISM 2009 - Shanghai, China Duration: 7 Nov 2009 → 8 Nov 2009

Conference

Conference	2009 International Conference on Web Information Systems and Mining, WISM 2009
Country/Territory	China
City	Shanghai
Period	07/11/2009 → 08/11/2009

Keywords

A-greedy
Adaptive
Query optimization
Web service
WSPRC

Access to Document

10.1109/WISM.2009.78

AUB Link

Search for the material in Aalborg University Library's search engine

Cite this

@inproceedings{2d2fa3a8e36545278c3ff74600f72a9b,

title = "WSPRC: An adaptive model for query optimization over web services",

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 comparision and experimental results show that the WSPRC model and A-Greedy improve the efficiency of querying optimization over Web services.",

keywords = "A-greedy, Adaptive, Query optimization, Web service, WSPRC",

author = "Dunlu Peng and Chen Li and Feng Zhu and Ning Zhang",

year = "2009",

month = dec,

day = "1",

doi = "10.1109/WISM.2009.78",

language = "English",

isbn = "9780769538174",

pages = "347--351",

booktitle = "2009 International Conference on Web Information Systems and Mining, WISM 2009",

note = "2009 International Conference on Web Information Systems and Mining, WISM 2009 ; Conference date: 07-11-2009 Through 08-11-2009",

}

TY - GEN

T1 - WSPRC

T2 - 2009 International Conference on Web Information Systems and Mining, WISM 2009

AU - Peng, Dunlu

AU - Li, Chen

AU - Zhu, Feng

AU - Zhang, Ning

PY - 2009/12/1

Y1 - 2009/12/1

N2 - 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 comparision and experimental results show that the WSPRC model and A-Greedy improve the efficiency of querying optimization over Web services.

AB - 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 comparision and experimental results show that the WSPRC model and A-Greedy improve the efficiency of querying optimization over Web services.

KW - A-greedy

KW - Adaptive

KW - Query optimization

KW - Web service

KW - WSPRC

UR - http://www.scopus.com/inward/record.url?scp=77749295770&partnerID=8YFLogxK

U2 - 10.1109/WISM.2009.78

DO - 10.1109/WISM.2009.78

M3 - Article in proceeding

AN - SCOPUS:77749295770

SN - 9780769538174

SP - 347

EP - 351

BT - 2009 International Conference on Web Information Systems and Mining, WISM 2009

Y2 - 7 November 2009 through 8 November 2009

ER -

WSPRC: An adaptive model for query optimization over web services

Abstract

Conference

Keywords

Access to Document

AUB Link

Other files and links

Fingerprint

Cite this