A modified maintenance algorithm for updating FUSP tree in dynamic database

Abstract

In the past, we proposed a pre-large FUSP tree to preserve and maintain both large and pre-large sequences in the built tree structure. In this paper, the pre-large concept is also adopted for maintaining and updating the FUSP tree. Only large sequences are kept in the built tree structure for reducing computations. The PreFUSP-TREE-MOD maintenance algorithm is proposed to reduce the rescans of the original database due to the pruning properties of pre-large concept. When the number of modified sequences is smaller than the safety bound of the pre-large concept, better results can be obtained by the proposed PreFUSP-TREE-MOD maintenance algorithm for sequence modification in the dynamic database.