High-dimensional similarity joins

A new algorithm is presented that utilizes a new index structure, called the /spl epsiv/-kdB tree, for fast spatial similarity joins on high-dimensional points, which reduces the number of neighboring leaf nodes that are considered for the join test, as well as the traversal cost of finding appropriate branches in the internal nodes.

Abstract

Many emerging data mining applications require a similarity join between points in a high-dimensional domain. We present a new algorithm that utilizes a new index structure, called the /spl epsiv/-kdB tree, for fast spatial similarity joins on high-dimensional points. This index structure reduces the number of neighboring leaf nodes that are considered for the join test, as well as the traversal cost of finding appropriate branches in the internal nodes. The storage cost for internal nodes is independent of the number of dimensions. Hence the proposed index structure scales to high-dimensional data. Empirical evaluation, using synthetic and real-life datasets, shows that similarity join using the /spl epsiv/-kdB tree is 2 to an order of magnitude faster than the R/sup +/ tree, with the performance gap increasing with the number of dimensions.