不确定性Top-K查询处理  

Top-K Query Processing Techniques on Uncertain Data

作　　者：李文凤[1] 彭智勇[2] 李德毅[3] 

机构地区：[1]武汉大学软件工程国家重点实验室,湖北武汉430072 [2]武汉大学计算机学院,湖北武汉430072 [3]中国电子系统工程研究所,北京100840

出　　处：《软件学报》2012年第6期1542-1560,共19页Journal of Software

基　　金：国家自然科学基金(61070011);湖北省自然科学基金国际合作重点项目;武汉市学科带头人计划(201150530139)

摘　　要：高效Top-K查询处理在涉及大量数据交互的应用中是一项重要技术,随着应用中不确定性数据的大量涌现,不确定性数据的管理逐渐引起人们的重视.不确定性数据上Top-K查询从语义和处理上都呈现出与传统Top-K查询不同的特点.在主流不确定性数据模型和可能世界语义模型下,学者们已经提出了多种不确定性Top-K查询的语义和处理方法.介绍了当前不确定性Top-K查询的研究工作,并对其进行分类,讨论包括语义、排序标准、算法以及应用等方面的技术.最后提出不确定性Top-K查询面临的挑战和下一步的发展方向.Efficient processing of Top-K queries has environment involving massive amounts of data. With the always been a significant technique in the interactive emerging of imprecise data, the management of them has gradually raised people＇s attention. In contrast with traditional Top-K query, Top-K query on uncertain data presents different features both in semantics and computation. On the basis of prevailing uncertain data model and possible world semantic model, researchers have already studied multiple sound semantics and efficient approaches. This survey describes and classifies Top-K processing techniques on uncertain data including semantics, rank criteria, algorithms and implementation levels, and so on. Finally, the challenges and future research trends in processing of Top-k queries on uncertain data are predicated.

关 键 词：Top—K查询语义 Top-K查询处理 排序标准 不确定性数据 可能世界 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]