当前位置: X-MOL 学术Int. J. Coop. Inf. Syst. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
An Efficient Optimization Approach for Top-k Queries on Uncertain Data
International Journal of Cooperative Information Systems ( IF 0.5 ) Pub Date : 2017-05-24 , DOI: 10.1142/s0218843017410027
Zhiqiang Zhang 1 , Xiaoyan Wei 1 , Xiaoqin Xie 1 , Haiwei Pan 1 , Yu Miao 1
Affiliation  

Uncertain data is inherent in various important applications and Top-[Formula: see text] query on uncertain data is an important query type for many applications. To tackle the performance issue of evaluating Top-[Formula: see text] query on uncertain data, an efficient optimization approach was proposed in this paper. This method can anticipate the tuples most likely to become Top-[Formula: see text] result based on dominant relationship analysis, greatly reducing the amount of data in query processing. When the database is updated, this method could determine whether the change affects the current query result, and help us to avoid unnecessary re-query. The experimental results prove the feasibility and effectiveness of this method.

中文翻译:

一种针对不确定数据的 Top-k 查询的有效优化方法

不确定数据是各种重要应用所固有的,Top-[公式:见正文]对不确定数据的查询是许多应用的重要查询类型。针对不确定数据评估Top-[Formula:see text]查询的性能问题,本文提出了一种有效的优化方法。该方法可以基于优势关系分析预测最有可能成为Top-[公式:见正文]结果的元组,大大减少了查询处理中的数据量。当数据库更新时,该方法可以判断更改是否影响当前查询结果,帮助我们避免不必要的重新查询。实验结果证明了该方法的可行性和有效性。
更新日期:2017-05-24
down
wechat
bug