Matching Algorithm of Semantic Web Based on Cache Library

When a large number of service requests, the matching algorithm of semantic-based web service appear the shortcomings of inefficient. A new matching algorithm based on the cache library is proposed. The service which matched successfully at first was put into the cache library. When the service requested come, it should first match with the service in the cache library, if fails then match with the services in the registration database. At the same time, the strategy of matching in steps is proposed, and the matching process is decomposed into several steps. The experimental results show that the algorithm could improve the matching efficiency apparently.