Quicker range- and k-NN joins in metric spaces

作者：

Highlights：

• We substantially improve the space and time complexity of the Quickjoin algorithm.

• We show how to select good pivots for Quickjoin.

• We generalize the Quickjoin algorithm to handle k-nearest neighbor joins.

摘要

Highlights•We substantially improve the space and time complexity of the Quickjoin algorithm.•We show how to select good pivots for Quickjoin.•We generalize the Quickjoin algorithm to handle k-nearest neighbor joins.

论文关键词：Metric spaces,Similarity joins,k-nearest neighbors,Range searching

论文评审过程：Available online 30 September 2014, Version of Record 31 May 2015.

论文官网地址：https://doi.org/10.1016/j.is.2014.09.006