An Efficient Technique for Nearest-Neighbor Query Processing on the SPY-TEC
An Efficient Technique for Nearest-Neighbor Query Processing on the SPY-TEC
复制标题
SPY-TEC 上最近邻查询处理的高效技术
DOI：
--
复制
发表时间：
2003
影响因子：
8.9
通讯作者：
Hyoung
中科院分区：
文献类型：
--
作者：
Dong;Hyoung
使用特殊的分区策略将间谍-TEC（球形金字塔技术）作为用于高维数据空间的新索引方法，该方法使用将D维数据空间划分为2D球形金字塔的特殊分区策略。在间谍-TEC中，通过特殊的分区策略引入了一种用于处理超球范围查询的有效算法。但是，未提出在相似性搜索中经常使用的处理K-Neart-neighbor查询的技术。在本文中，我们提出了一种有效的算法，用于通过扩展增量最近的邻居算法来处理间谍-TEC上最近的邻居查询。我们还引入了一个度量标准，该指标可用于指导在间谍-Tec上找到最近的邻居时有序的最佳遍历。最后，我们表明，我们的技术通过将其与R*-Tree，X-Tree进行比较，通过广泛的实验将其比较，在处理K-Nearp-neighbor的查询中的相关技术显着胜过处理。
The SPY-TEC (spherical pyramid-technique) was proposed as a new indexing method for high-dimensional data spaces using a special partitioning strategy that divides a d-dimensional data space into 2d spherical pyramids. In the SPY-TEC, an efficient algorithm for processing hyperspherical range queries was introduced with a special partitioning strategy. However, the technique for processing k-nearest-neighbor queries, which are frequently used in similarity search, was not proposed. In this paper, we propose an efficient algorithm for processing nearest-neighbor queries on the SPY-TEC by extending the incremental nearest-neighbor algorithm. We also introduce a metric that can be used to guide an ordered best-first traversal when finding nearest neighbors on the SPY-TEC. Finally, we show that our technique significantly outperforms the related techniques in processing k-nearest-neighbor queries by comparing it to the R*-tree, the X-tree, and the sequential scan through extensive experiments.