Ranking in Spatial Databases
Ranking in Spatial Databases
复制标题
DOI：
10.1007/3-540-60159-7_6
复制
发表时间：
1995-08
期刊：
影响因子：
--
通讯作者：
Gísli R. Hjaltason;H. Samet
中科院分区：
文献类型：
--
作者：
Gísli R. Hjaltason;H. Samet
介绍并分析了一种根据与查询对象的距离递增对空间对象进行排序的算法。该算法利用了层次化的空间数据结构。预期的应用领域是数据库环境，其中空间数据结构充当索引。从逐个报告对象的意义上讲，该算法是递增的，以便查询处理器可以流水线方式使用该算法来处理涉及邻近的复杂查询。它非常适合最近邻查询，并且具有不需要事先固定的性质。
An algorithm for ranking spatial objects according to increasing distance from a query object is introduced and analyzed. The algorithm makes use of a hierarchical spatial data structure. The intended application area is a database environment, where the spatial data structure serves as an index. The algorithm is incremental in the sense that objects are reported one by one, so that a query processor can use the algorithm in a pipelined fashion for complex queries involving proximity. It is well suited forknearest neighbor queries, and has the property thatkneeds not be fixed in advance.