Eclipse:实用性超越kNN和Skyline
Eclipse: Practicability Beyond kNN and Skyline
摘要:
$k$最近邻($k$ NN)查询是数据库中的基本问题。给定一组多维数据点和一个查询点,$k$ NN基于评分函数(例如给定属性权重向量的加权和)返回$k$最近邻。然而,属性权重向量在实践中可能难以指定。Skyline返回的点包括所有可能的最近邻居,而不需要精确的属性权重向量或评分函数,但返回的点的数量对于实际使用来说可能非常大。在本文中,我们提出了一种新的\emph{eclipse}定义,它提供了一个更灵活和可定制的定义比经典的$1$神经网络和天际线。在Eclipse中,用户可以指定属性权重的范围,并控制返回点的数量。我们证明了$1$ NN和skyline都是eclipse的实例。为了计算日蚀点,提出了一种时间复杂度为$O(n^22^{d-1})$的基线算法,并通过将日蚀问题转化为天际线问题,提出了一种改进的基于$O(n\log ^{d-1}n)$时间变换的日蚀点计算算法,其中$n$为点的个数,$d$为维数.此外,我们提出了一种新的基于索引的算法,利用对偶变换,具有更好的效率。在真实NBA数据集和合成数据集上的实验结果表明了我们的eclipse算法的有效性和效率。
英文摘要:
The $k$ nearest neighbor ($k$NN) query is a fundamental problem in databases. Given a set of multidimensional data points and a query point, $k$NN returns the $k$ nearest neighbors based on a scoring function such as weighted sum given an attribute weight vector. However, the attribute weight vector can be difficult to specify in practice. Skyline returns the points including all possible nearest neighbors without requiring the exact attribute weight vector or a scoring function but the number of returned points can be prohibitively large for practical use. In this paper, we propose a novel \emph{eclipse} definition which provides a more flexible and customizable definition than the classic $1$NN and skyline. In eclipse, users can specify a range of attribute weights and control the number of returned points. We show that both $1$NN and skyline are instantiations of eclipse. To compute eclipse points, we propose a baseline algorithm with time complexity of $O(n^22^{d-1})$, and an improved $O(n\log ^{d-1}n)$ time transformation-based algorithm by transforming the eclipse problem to the skyline problem, where $n$ is the number of points and $d$ is the number of dimensions. Furthermore, we propose a novel index-based algorithm utilizing duality transform with much better efficiency. The experimental results on the real NBA dataset and the synthetic datasets demonstrate the effectiveness and efficiency of our eclipse algorithms.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。