Representing web service operations as N-ary trees and RDF serializations to allow service comparison and automatic documentation

With the increasing development of Web services (WS) it is necessary to use tools capable of providing better and more efficient search and classification mechanisms. Bringing to users the facility to select a service or a set of services that satisfy the specified functional requirements of an application. However, the existing methods for classification and searching are developed with similar aims, but they use different input elements for its running, making them mutually incompatible among all approaches developed, avoiding their reusability. Therefore, we propose the representation of WS operations as N-ary trees for semantic and/or structural comparisons. Allowing independent comparison algorithms use N-ary trees as the same input, to making them compatible. Allowing Make more specific and focused algorithms, which can separate the semantic part of an operation with its structure by using a unique input, either they have semantic annotations or not because our N-ary trees have all necessary information for semantic or structural comparisons. Additionally, we propose to process service operations as tree structures and represent them using RDF - a language for knowledge representation - to execute inferences and get semantic annotations. This semantic representation will specify easily the relation between composite variables names and the names of their primitive variables which are contained in a WS operation. Generating RDF serializations that easy the automatic extraction of semantic relations between the variables names of an operation and allowing to link variables names with their semantics defined in a different RDF resource. Generating automatic documentation for web services operations by using the information of semantic repositories.