两种新的非确定数据库上的Top-k查询  

Two new Top-k queries in uncertain database

作　　者：邱鑫[1] 林欣[1] 

机构地区：[1]上海市多维度信息处理重点实验室华东师范大学,上海200241

出　　处：《华东师范大学学报（自然科学版）》2017年第1期52-63,共12页Journal of East China Normal University(Natural Science)

基　　金：国家自然科学基金(61572193);上海张江国家自主创新示范区专项发展基金(201411-JAB108-002);上海市科学技术委员会项目(14DZ2260800)

摘　　要：由于当前已有的在非确定数据库上的Tbp-k查询普遍基于元组层面,使得应用受限.为了让查询结果更符合直觉,提出了两种新的非确定数据库上的基于x-元组层面的Top-k查询及其执行算法.这两种新的查询综合x-元组中各元组的评分和置信度,获得在返回结果中最具实际意义的位置.查询的执行算法经过优化,执行效率明显改善.Since the pre-existing Top-fc queries in uncertain databases almost are based on tuple level rather than x-tuple level restricts its application.The paper proposes two new instance-level Top-fc queries and executive algorithm in uncertain databases in order to get intuitive query results.These two new queries take both rank and confidence of each x-tuple＇s tuple,figuring out the most meaningful position in the returned results.After the optimization of the executive algorithm,its executive efficiency has been improved significantly.

关 键 词：非确定数据库 TOP-K查询 

分 类 号：TP392[自动化与计算机技术—计算机应用技术]