东北大学学报（自然科学版）

东北大学学报(自然科学版) ›› 2011, Vol. 32 ›› Issue (5): 630-633.DOI: -

• 论著 • 上一篇    下一篇

空间数据库中的一种约束组最近组查询方法

陈默;贾子熙;于戈;谷峪;   

  1. 东北大学软件学院;东北大学信息科学与工程学院;东北大学医学影像计算教育部重点实验室;
  • 收稿日期:2013-06-19 修回日期:2013-06-19 发布日期:2013-04-04
  • 通讯作者: -
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(61003058);;

A constrained group nearest group query method for spatial databases

Chen, Mo (1); Jia, Zi-Xi (2); Yu, Ge (2); Gu, Yu (2)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China; (2) School of Software, Northeastern University, Shenyang 110819, China; (3) Key Laboratory of Medical Image Computing, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Chen, M.
  • About author:-
  • Supported by:
    -

RichHTML

0

PDF (PC)

550

摘要： 针对具有约束需求的空间数据库查询应用,定义了一种新查询——约束组最近组查询,并根据其约束特点深入研究了该查询的处理技术.首先,为了使组最近组查询结果的查询点数量满足约束条件,设计了一种约束聚簇算法,用来在查询初始阶段对查询点进行约束聚簇;其次,采用MBM和SHR方法在这些初始簇中计算初始查询结果;最后,通过迭代更新聚簇获得查询最优解,并提出一种剪枝策略来减少更新代价.实验结果证明了所提算法的有效性和实用性.

关键词: 空间数据库, 约束, 组最近组, 聚簇

Abstract: Considering some real applications with the constraints of spatial database queries, we define a new type of query called constrained group nearest group query, and investigate query processing technology according to the "constraint" property. A constraint clustering algorithm is designed to ensure that the query point number of the result satisfies the constraint. MBM and SHR are employed to obtain initial results. Then, a pruning strategy is introduced to improve the iterative updating procedure, which enable the obtaining of optimal results. Experiments were implemented to verify the effectiveness and practicality of the method.

中图分类号: