Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Database Systems for Adanced Applications - 16th International Conference, DASFAA 2011, International Workshops |
| Untertitel | GDB, SIM3, FlashDB, SNSMW, DaMEN, DQIS, Proceedings |
| Herausgeber/-innen | Jianliang Xu, Ge Yu, Shuigeng Zhou, Rainer Unland |
| Herausgeber (Verlag) | Springer Verlag |
| Seiten | 28-39 |
| Seitenumfang | 12 |
| ISBN (Print) | 9783642202438 |
| Publikationsstatus | Veröffentlicht - 2011 |
| Veranstaltung | 16th International Conference on Database Systems for Advanced Applications, DASFAA 2011 - Hong Kong, China Dauer: 22 Apr. 2011 → 25 Apr. 2011 |
Publikationsreihe
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Band | 6637 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (elektronisch) | 1611-3349 |
Abstract
Existing techniques for Web service discovery focus mainly on matching functional parameters of atomic services, such as inputs and outputs. However, one of the main advantages of Web services is that they are often composed into more complex processes to achieve a given goal. Applying such techniques in these cases, ignores the workflow structure of the composite process, and therefore may produce matches that are not very accurate. To overcome this limitation, we propose in this paper a graph-based method for matching composite services, that are semantically described as OWL-S processes. We propose a graph representation of composite OWL-S processes and we introduce a matching algorithm that performs comparisons not only at the level of individual components but also at the structural level, taking into consideration the control flow among the atomic components. We also report our preliminary results of our experimental evaluation.
ASJC Scopus Sachgebiete
- Mathematik (insg.)
- Theoretische Informatik
- Informatik (insg.)
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Database Systems for Adanced Applications - 16th International Conference, DASFAA 2011, International Workshops: GDB, SIM3, FlashDB, SNSMW, DaMEN, DQIS, Proceedings. Hrsg. / Jianliang Xu; Ge Yu; Shuigeng Zhou; Rainer Unland. Springer Verlag, 2011. S. 28-39 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Band 6637 LNCS).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Graph-based matching of composite owl-s services
AU - Cuzzocrea, Alfredo
AU - Decoi, Juri Luca
AU - Fisichella, Marco
AU - Skoutas, Dimitrios
N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2011.
PY - 2011
Y1 - 2011
N2 - Existing techniques for Web service discovery focus mainly on matching functional parameters of atomic services, such as inputs and outputs. However, one of the main advantages of Web services is that they are often composed into more complex processes to achieve a given goal. Applying such techniques in these cases, ignores the workflow structure of the composite process, and therefore may produce matches that are not very accurate. To overcome this limitation, we propose in this paper a graph-based method for matching composite services, that are semantically described as OWL-S processes. We propose a graph representation of composite OWL-S processes and we introduce a matching algorithm that performs comparisons not only at the level of individual components but also at the structural level, taking into consideration the control flow among the atomic components. We also report our preliminary results of our experimental evaluation.
AB - Existing techniques for Web service discovery focus mainly on matching functional parameters of atomic services, such as inputs and outputs. However, one of the main advantages of Web services is that they are often composed into more complex processes to achieve a given goal. Applying such techniques in these cases, ignores the workflow structure of the composite process, and therefore may produce matches that are not very accurate. To overcome this limitation, we propose in this paper a graph-based method for matching composite services, that are semantically described as OWL-S processes. We propose a graph representation of composite OWL-S processes and we introduce a matching algorithm that performs comparisons not only at the level of individual components but also at the structural level, taking into consideration the control flow among the atomic components. We also report our preliminary results of our experimental evaluation.
UR - http://www.scopus.com/inward/record.url?scp=85010224414&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-20244-5_4
DO - 10.1007/978-3-642-20244-5_4
M3 - Conference contribution
AN - SCOPUS:85010224414
SN - 9783642202438
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 28
EP - 39
BT - Database Systems for Adanced Applications - 16th International Conference, DASFAA 2011, International Workshops
A2 - Xu, Jianliang
A2 - Yu, Ge
A2 - Zhou, Shuigeng
A2 - Unland, Rainer
PB - Springer Verlag
T2 - 16th International Conference on Database Systems for Advanced Applications, DASFAA 2011
Y2 - 22 April 2011 through 25 April 2011
ER -