Abstract
The current register and discovery protocol as UDDI is a keyword-based and precisely matching service discovery mechanism and it can’t describe the semantic information of a Web service. Many suitable Web services can’t be discovered automatically by the traditional service discovery methods. In order to resolve these problems, this paper presents a method of semantic Web service discovery based on bipartite graph matching. It makes computers recognize semantic information of Web Services. The method contributes to the improvement of service discovery efficiency when service is retrieved in an automatic way.KeywordsUDDIsemantic Web servicebipartite graph matching
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.