Suffix Forest: A novel in-memory data structure for analyzing time-series data

The present invention generally relates to a method for introducing suffix forest for mining tri-clusters from time series data comprises scanning all rows one by one and creating suffixes by deleting one front item in each rotation and appended in the tree to build a suffix-tree from SFD; showing data that satisfies each element in a particular branch by leaf node thereby gives clustered results; performing a cumulative addition of new suffixes over the suffix-tree built from the first SFD to merge multiple SFDs, wherein cumulative addition follows the match and buildEdge function to generate the Suffix-forest; and removing redundancy by pruning and merging the dataset of TM thereby extracting tri-clusters from leaf of the data structure.