不确定数据上的Reverse Top-k查询  

Reverse Top-k Query on Uncertain Data

作　　者：王晓伟[1] 贾焰[1] 

机构地区：[1]国防科技大学计算机学院,长沙410073

出　　处：《计算机科学》2012年第2期187-190,共4页Computer Science

基　　金："863"国家高技术研究发展计划(2007AA010502;2007AA01Z474)资助

摘　　要：传统的top-k查询为顾客返回符合其偏好的产品集合,reverse top-k查询则返回将给定产品作为top-k结果的偏好集合。reverse top-k查询由于能帮助生产者评估产品对顾客的影响,因此在商业分析中具有重要价值。现有的reverse top-k查询假设数据是精确的,许多现实应用中,数据的不确定性广泛存在。将reverse top-k查询扩展到不确定数据上,并给出了基于物化视图的高效查询算法GMV。实验结果表明,GMV算法能够减少需要计算的偏好数量,具有较高的计算效率。Traditional top-k query returns the products to customers according to their preferences,whereas reverse top-k query returns the preferences for which a given product is in the top-k result.Reverse top-k query is valuable in business analysis because it can help the manufacturers evaluate the impact of a product on customers.Existing reverse top-k query assumes the underlying data is certain,however,uncertainty arises in many real applications.In this paper,we extended reverse top-k query to uncertain data,and provided an efficient query algorithm named GMV based on materialized views.Our experimental evaluation demonstrates that,GMV can reduce the preferences which need to be computed,and achieves relatively high computational efficiency.

关 键 词：不确定数据 偏好 REVERSE TOP-K查询 物化视图 

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