The Community for Technology Leaders
Web Services, European Conference on (2007)
Halle, Germany
Nov. 26, 2007 to Nov. 28, 2007
ISBN: 0-7695-3044-3
pp: 139-148
Web service discovery requires matching techniques for comparing and selecting web service descriptions based on user constraints. Semantic-based approaches achieve higher recall than other approaches (such as syntax-based approaches), because they employ ontological reasoning mechanisms to match syntactically heterogeneous descriptions. However, existing semantic-based approaches are not scalable as they perform an exhaustive search to locate composite services that conform to global constraints. This paper proposes a semantic-based matching technique that locates composite services. It relates attributes of services to a common attribute to ensure that they have the same scope. This enables the assigned values to be compared and evaluated against a given global constraint. Conforming composite services are located in polynomial time with a three-dimensional data structure that indexes services based on their types, attributes and the assigned values. Simulation results indicate that the proposed approach achieves higher recall than syntax-based approaches and is more scalable than existing semantic-based approaches.
Zahir Tari, Nalaka Gooneratne, James Harland, "Matching Strictly Dependent Global Constraints for Composite Web Services", Web Services, European Conference on, vol. 00, no. , pp. 139-148, 2007, doi:10.1109/ECOWS.2007.7
92 ms
(Ver 3.3 (11022016))