Software Architecture Recovery through Graph Mining Technique and Reduction of Complexity Involved in A* Algorithm through Stable Marriage Problem
|Author||Pavankumar Kolla , Kolla HariPriyanka, R Manjula.|
|Issue Date||May 01, 2011|
|Publishing Date||May 01, 2011|
|Keywords||Reverse Engineering, spanning tree, bipartite graph, AQL, Software Architecture recovery, Graph Matching Problem.|
This paper represents a technique for recovering the Software Architecture based on Graph Pattern Matching by the help of mining Techniques. Generally Software Architecture is represented in terms of graphs with set of vertices and edges. Finding the frequent data sets is the major step in the software architecture recovery. Many algorithms are proposed for this, for example Apriori based. In this paper to find the frequent data sets and a maximum association between the graphs we used an efficient algorithm called TMGM (tree based Maximal Graph Mining Technique). The results have shown that our proposed Graph mining technique is more efficient in recovering the Software Architecture. For pattern matching problem, Software Architecture Recovery uses A* Algorithm which runs in exponential time. In this paper we proposed an algorithm which runs in linear time through stable marriage problem.