...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Knowledge and Data Engineering, IEEE Transactions on >U-Skyline: A New Skyline Query for Uncertain Databases
【24h】

U-Skyline: A New Skyline Query for Uncertain Databases

机译：U-Skyline：不确定数据库的新Skyline查询

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The skyline query, aiming at identifying a set of skyline tuples that are not dominated by any other tuple, is particularly useful for multicriteria data analysis and decision making. For uncertain databases, a probabilistic skyline query, called P-Skyline, has been developed to return skyline tuples by specifying a probability threshold. However, the answer obtained via a P-Skyline query usually includes skyline tuples undesirably dominating each other when a small threshold is specified; or it may contain much fewer skyline tuples if a larger threshold is employed. To address this concern, we propose a new uncertain skyline query, called U-Skyline query, in this paper. Instead of setting a probabilistic threshold to qualify each skyline tuple independently, the U-Skyline query searches for a set of tuples that has the highest probability (aggregated from all possible scenarios) as the skyline answer. In order to answer U-Skyline queries efficiently, we propose a number of optimization techniques for query processing, including 1) computational simplification of U-Skyline probability, 2) pruning of unqualified candidate skylines and early termination of query processing, 3) reduction of the input data set, and 4) partition and conquest of the reduced data set. We perform a comprehensive performance evaluation on our algorithm and an alternative approach that formulates the U-Skyline processing problem by integer programming. Experimental results demonstrate that our algorithm is 10-100 times faster than using CPLEX, a parallel integer programming solver, to answer the U-Skyline query.
机译：天际线查询旨在识别一组不受任何其他元组支配的天际线元组，它对于多准则数据分析和决策特别有用。对于不确定的数据库，已经开发了一种称为P-Skyline的概率性天际查询，以通过指定概率阈值来返回天际元组。但是，通过P-Skyline查询获得的答案通常包含指定了较小阈值的天际线元组，这是不希望的。如果采用较大的阈值，则它可能包含更少的天际线元组。为了解决这个问题，我们提出了一种新的不确定性天际线查询，称为U-Skyline查询。 U-Skyline查询没有设置概率阈值来独立限定每个天际线元组，而是搜索一组具有最高概率（从所有可能的场景中汇总）的元组作为天际线答案。为了有效回答U-Skyline查询，我们提出了多种查询处理的优化技术，包括1）U-Skyline概率的计算简化，2）不合格候选天际线的修剪和查询处理的提前终止，3）减少输入数据集，以及4）分割并征服简化后的数据集。我们对算法进行了全面的性能评估，并通过整数编程来表达U-Skyline处理问题。实验结果表明，该算法比使用并行整数编程求解器CPLEX回答U-Skyline查询的速度快10-100倍。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号