Index Filtering Algorithm Based on Minimum Enclosing Circle Partition
Jie Chen, Binxing Fang, Jianlong Tan, Shichao Jin · Chinese Journal of Computers · 2012
Filtering algorithm design play a very important role in information content security process system,filtering speed become the first consideration factor for improving the system performance.Index is an effective method to cope with massive data and can get a good performance.Unfortunately,most of existing index methods especially designed for information retrieval application and these indexes cannot achieve a good performance for filtering application.In order to improve the filtering performance,this paper proposes an index filtering method based on minimum enclosing circle data partition,and built a particular filtering index called F-tree.This method considers the imbalance data distribution with more positive and less negative in real filtering situation,the minimum enclosing circle partition method is used to obtain maximum negative area.In query step,the positive data falls into negative area with maximum probability in order to get up to the all data judgment speed.Experimental results show that the proposed method can improve the filtering performance by reducing the times of computation.