作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2013, Vol. 39 ›› Issue (2): 50-54. doi: 10.3969/j.issn.1000-3428.2013.02.010

• 软件技术与数据库 • 上一篇    下一篇

基于网格索引的数据流子空间概率轮廓查询

杨艳艳,赵 雷,杨季文   

  1. (苏州大学计算机科学与技术学院,江苏 苏州 215006)
  • 收稿日期:2012-03-26 修回日期:2012-05-08 出版日期:2013-02-15 发布日期:2013-02-13
  • 作者简介:杨艳艳(1988-),女,硕士研究生,主研方向:流数据管理与挖掘;赵 雷,副教授、博士;杨季文,教授
  • 基金资助:
    国家自然科学基金资助项目(61073061)

Probabilistic Skyline Query in Subspaces over Data Streams Based on Grid Index

YANG Yan-yan, ZHAO Lei, YANG Ji-wen   

  1. (School of Computer Science and Technology, Soochow University, Suzhou 215006, China)
  • Received:2012-03-26 Revised:2012-05-08 Online:2013-02-15 Published:2013-02-13

摘要: 在数据流子空间上的连续概率轮廓查询(CPSQS)基础上,提出一种基于网格索引结构的概率轮廓查询算法。采用适合于子空间轮廓计算的网格索引结构,将数据空间划分成若干个格,利用格间的支配关系,减少对象之间的比较次数。同时挖掘全空间与子空间上格的概率上下界关系,设计有效的剪枝策略提高CPSQS算法的性能。理论分析和实验结果表 明,该算法能满足实际应用中用户的个性化查询要求,降低查询响应时间。

关键词: 数据流, 子空间, 轮廓查询, 概率查询, 不确定数据

Abstract: This paper proposes Continuous Probabilistic Skyline Query in Subspaces(CPSQS) over sliding window on uncertain data streams. Moreover, a novel algorithm using a regular grid index, which is adaptable for solving subspace skyline issue, is presented to reduce the dominating testing costs. At the same time, based on the subtle relationship between the probabilistic bounds of full space and an arbitrary subspace, a set of pruning strategies are developed to improve the performance of CPSQS. Analytical analysis and experimental results show that this algorithm can meet individuation query of users, reduce query response time.

Key words: data streams, subspace, skyline query, probabilistic query, uncertain data

中图分类号: