首页> 外文会议>International Conference on Computer Science and Software Engineering >QBSQ: A Quad-tree Based Algorithm for Skyline Query
【24h】

QBSQ: A Quad-tree Based Algorithm for Skyline Query

机译:QBSQ:基于四树的天际线查询算法

获取原文

摘要

Skyline has been proposed as an important operation for multi-criteria decision making, data mining and visualization, and user preference queries. In this paper, we systematically explore a Quad-tree based approach for computing skyline points which contributes to a better performance than traditional ones for skyline queries. Based on this approach, we present a novel algorithm QBSQ for finding the set of global skyline points. QBSQ partitions data points dynamically by means of the configuration characters of Quad-tree, and then deletes points dominated by other(s) while constructing the tree. The amount of work for domination checking is minimized and the efficiency of our algorithm is thus improved. Extensive experiments prove the efficiency and the scalability of QBSQ algorithm.
机译:Skyline已被提议作为多标准决策,数据挖掘和可视化以及用户偏好查询的重要操作。在本文中,我们系统地探索了基于四树的计算地平线点的方法,这有助于比传统的地平线查询的性能更好。基于这种方法,我们提出了一种新颖的QBSQ来查找全球天际线点集。 QBSQ通过四树的配置字符动态分区数据点,然后在构建树的同时删除由其他(s)主导的点。因此,统治检查的工作量最小化,因此提高了算法的效率。广泛的实验证明了QBSQ算法的效率和可扩展性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号