Name
Abstract | ||
|---|---|---|
In this paper, we propose a framework that reduces the complexity of service substitution. The framework is based on two substitution relations and corresponding theorems. The proposed relations and theorems allow organizing available services into groups. Then, the complexity of retrieving candidate substitute services for the target service and generating corresponding adapters scales up with the number of available groups, instead of scaling up with the number of available services. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1109/ASE.2009.58 | Auckland |
Keywords | Field | DocType |
Web services,computational complexity,information retrieval,candidate substitute service retrieval,service complexity,service substitution,evolution,maintenance,service substitution | XML,Information retrieval,Computer science,Theoretical computer science,Software,Web service,Database,Computational complexity theory | Conference |
ISSN | ISBN | Citations |
1938-4300 E-ISBN : 978-0-7695-3891-4 | 978-0-7695-3891-4 | 7 |
PageRank | References | Authors |
0.53 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dionysis Athanasopoulos | 1 | 47 | 5.19 |
| Apostolos V. Zarras | 2 | 11 | 1.10 |
| V. Issarny | 3 | 200 | 16.78 |