摘要
频繁项的查询是一项非常重要的技术,但在新兴的不确定数据领域却是一项新的研究课题.基于不确定数据,提出了一种新的频繁项定义,并提出了两条过滤规则,可以有效地减少检测数据的数量.最后提出高效的频繁项查询算法UFI,该算法通过找到概率求解中的递推规律,极大提高了单点检测效率.实验结果显示:提出的方法可以有效地减少候选集,降低搜索空间,改善在不确定数据上的查询性能.
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 two 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.These proposed methods can efficiently narrow the field of candidates and reduce corresponding searching space,thereby improving performance of query processing of uncertain data.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2011年第3期344-347,共4页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目(60873011)
