Semantic api matching for automatic service composition

ABSTRACT

In this paper, we address the problem of matching I/O descriptions of services to enable their automatic service composition. Specifically, we develop a method of semantic schema matching and apply it to the API schemas constituting the I/O descriptions of services. The algorithm assures an optimal match of corresponding entities by obtaining a maximum matching in a bi-partite graph formed from the attributes.

REFERENCES

• 1: T. Berners-Lee et al. The semantic web. Scientific American, 2001.
• 2: Mark Goldberg , Thomas Spencer, An efficient parallel algorithm that finds independent sets of guaranteed size, SIAM Journal on Discrete Mathematics, v.6 n.3, p.443-459, Aug. 1993 [doi>10.1137/0406036]
• 3: J. Blythe et al. The role of planning in grid computing. In Proc. ICAPS, 2003.
• 4: Jayant Madhavan , Philip A. Bernstein , Erhard Rahm, Generic Schema Matching with Cupid, Proceedings of the 27th International Conference on Very Large Data Bases, p.49-58, September 11-14, 2001
• 5: D. McDermott. Estimated regression planning for interactions with web services. In Proc. AIPS, 2002.
• 6: Similarity Flooding: A Versatile Graph Matching Algorithm and Its Application to Schema Matching, Proceedings of the 18th International Conference on Data Engineering, p.117, February 26-March 01, 2002
• 7: George A. Miller, WordNet: a lexical database for English, Communications of the ACM, v.38 n.11, p.39-41, Nov. 1995 [doi>10.1145/219717.219748]
• 8: Evren Sirin, James Hendler, and Bijan Parsia. Semi automatic composition of web services using semantic descriptions.

INDEX TERMS

General Terms:
Algorithms