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

A Constrained Group Nearest Group Query Method for Spatial Databases

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

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.