基于不确定数据的频繁项查询算法-JournalofNortheasternUniversity.PDF

第32 卷第3期 东 北 大 学 学 报 ( 自 然 科 学 版 ) Vol32, No. 3 201 1 年 3 月 Journal of Northeastern U niversity( Natural cience) Mar. 2 0 1 1 王 爽, 杨广明, 朱志良 ( , 110819) : , , , , UFI, , : , , : ; ; ; ; : TP 393 : A : 2011) Frequent Items Detection of Uncertain Data WAN G Shuang, YAN G Guangming, ZH U Zhiliang ( chool of oftw are, Northeastern University, henyang 110819, China. Corresponding author : WANG huang, Email: wangshuang neu @ 163. com) - Abstract: Frequent items detection has been an important feature of many applications, but it is a new area of research for emerging uncertain databases. A new definition of frequent items detection for uncertain data is proposed, thereby forming the basis for tw o efficient filtering rules that can significantly reduce the number of items to be detected. Furthermore, an efficient algorithm UFI is proposed to detect frequent items on uncertain databases. The UFI algorithm locates the recursive rule in the probability computation and greatly improves the efficiency of single data detection. T hese proposed methods can efficiently narrow the field of candidates and reduce corresponding searching space, thereby improving performance of query processing of uncertain data. Key words: frequent items; uncertain data; pruning rule; uncertain data model; query processing , , , ,