Processing Constrained K Closest Pairs Query in Spatial Databases

作     者：LIU Xiaofeng LIU Yunsheng XIAO Yingyuan 

作者机构：College of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074Hubei China 

出 版 物：《Wuhan University Journal of Natural Sciences》 (武汉大学学报（自然科学英文版）)

年 卷 期：2006年第11卷第3期

页      面：543-546页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 

基　　金：Supported by National Natural Science Foundationof China (60073045) 

主　　题：spatial databases query processing R-tree closest pairs query constrained closest pairs query 

摘      要：In this paper, constrained K closest pairs query is introduced, wbich retrieves the K closest pairs satisfying the given spatial constraint from two datasets. For data sets indexed by R trees in spatial databases, three algorithms are presented for answering this kind of query. Among of them, two-phase Range＋Join and Join＋Range algorithms adopt the strategy that changes the execution order of range and closest pairs queries, and constrained heap-based algorithm utilizes extended distance functions to prune search space and minimize the pruning distance. Experimental results show that constrained heap-base algorithm has better applicability and performance than two-phase algorithms.