1. A method for indexing a suffix tree in a social network, the method comprising: scanning, by a computing device, an input string and dividing the string into partitions each having a common prefix; performing no-merge suffix tree indexing on the divided partitions, wherein a suffix tree is built without performing a process of merging sub-trees having a common prefix in the no-merge suffix tree indexing; storing information on the partitions on which no-merge suffix tree indexing is performed; storing suffix nodes of the no-merge suffix tree; and establishing a prefix tree.
1. A method for indexing a suffix tree in a social network, the method comprising: scanning, by a computing device, an input string and dividing the string into partitions each having a common prefix; performing no-merge suffix tree indexing on the divided partitions, wherein a suffix tree is built without performing a process of merging sub-trees having a common prefix in the no-merge suffix tree indexing; storing information on the partitions on which no-merge suffix tree indexing is performed; storing suffix nodes of the no-merge suffix tree; and establishing a prefix tree. 5. The method of claim 1 , wherein when a condition that a generation frequency number of suffixes in the divided partitions is greater than a threshold value is satisfied, said storing information on the partitions includes storing the information regarding the partitions in a second storage unit.