An Efficient Computation of Reachability Labeling for Social Networking Using Graph Pattern Mining: an Application of Data Mining

Graphs form a powerful modeling tool to represent complex relationships among objects in an effective manner. Graph pattern matching is one of the areas of data mining where the data is stored in the form of graphs and the set of tuples that match a user-given graph pattern are extracted. For finding the set of matching tuples faster, all the possible paths in the large directed graph, i.e., transitive closure of the graph is compressed and maintained using 2-hop reachability labeling technique by assigning every node a 2-hop label. These 2-hop labels are computed using a geometry-based approach. In this paper, 2-hop labeling is computed efficiently from multi-interval codes, which is another compressed transitive closure technique using the geometry-based approach. Keywordsgraph pattern; graph matching; 2-hop cluster; 2-hop labeling;