JURNAL INTERNASIONAL
Journal of Theoritical and Apllied Information Technology
Discovery is one the cental resoning tasks in SOA systems, concerned with the detection of usable web service for a spesific request or application con-text. Aiming at the automation of this task, most exiting works on semantically enabled Web service discovery focus on the degree of match of two services based merely on their I/O pairs. Another approach for matchmaking in Semantic Web Services (SWS) that considers each service as a sub-graph of the semntic network of the ontology formed by inputs,outputs,pre and post-conditions with contribution of syntactial information such as keywords and textual descriptions. The similarity between services is defined as the similiarity between these graphs (Behavior Graphs). This paper presents the detailed descriptions of both approaches and it also analysess the advantages, disadvantages and retrieval effectineness of these two matchmaking systems (I/O Mat,BEH Mat) and proposess new algorithm for semantic m,atch king.
| JI03220025 | 004.0285 JATIT J JurnalInternasional | Perpus STMIK (Jurnal Internasional) | Tersedia |
Tidak tersedia versi lain