Description

• To propose holistic methods of top-k path join strategy for group relationship analysis. • This is used to discover k shortest paths between a pair of node sets. • Also to propose efficient method to find the constrained top- k shortest paths between the two virtual nodes. • This is used to reduce the cost of candidate path searching. • Two optimization techniques used in top-k for further improvements. • Which is used to pruning the search space with determine threshold in each candidate path generation.