Distance Browsing in Spatial Databases：（距离浏览在空间数据库中）.pdfVIP

Distance Browsing in Spatial Databases1 G´ısli R. Hjaltason and Hanan Samet Computer Science Department Center for Automation Research Institute for Advanced Computer Studies University of Maryland College Park, Maryland 20742 grh@ and hjs@ Abstract Two different techniques of browsing through a collection of spatial objects stored in an R-tree spatial data structure on the basis of their distances from an arbitrary spatial query object are compared. The con- ventional approach is one that makes use of a k -nearest neighbor algorithm where k is known prior to the invocation of the algorithm. Thus if m k neighbors are needed, the k -nearest neighbor algorithm needs to be reinvoked for m neighbors, thereby possibly performing some redundant computations. The second approach is incremental in the sense that having obtained the k nearest neighbors, the k + 1st neighbor can be obtained without having to calculate the k + 1 nearest neighbors from scratch. The incremental approach finds use when processing complex queries where one of the conditions involves spatial proximity (e.g., the nearest city to Chicago with population greater than a million), in which case a query engine can make use of a pipelined strategy. A general incremental nearest neighbor algorithm is presented that is applicable to a large class of hierarchical spatial data structures. This algorithm is adapted to the R-tree and its perfor- mance is compared to an existing k -nearest neighbor algorithm for R-trees [45]. Experiments show that the incremental nearest neighbor algorithm significantly outperforms the k -neare