arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1404.3461cs.DB
收藏

一种基于二维划分的团队排序策略(RTP)

A 2D based Partition Strategy for Solving Ranking under Team Context (RTP)

Xiaolu Lu, Dongxu Li, Xiang Li, Ling Feng

摘要:

在本文中,我们提出了一个基于2D的分区方法来解决在没有先验数据集上的团队上下文(RTC)下的排名问题。我们首先使用所有维度中的最小值和最大值将数据映射到2D空间。然后,我们构造窗口查询与当前团队上下文的考虑。此外,在查询映射过程中,我们可以预先修剪一些元组,这不是排名靠前的。这个预先分类的步骤将推迟处理这些元组,并且可以在为问题提供解决方案的同时节省成本。实验表明,该算法在大数据集上具有良好的性能,并且具有正确性。

英文摘要:

In this paper, we propose a 2D based partition method for solving the problem of Ranking under Team Context(RTC) on datasets without a priori. We first map the data into 2D space using its minimum and maximum value among all dimensions. Then we construct window queries with consideration of current team context. Besides, during the query mapping procedure, we can pre-prune some tuples which are not top ranked ones. This pre-classified step will defer processing those tuples and can save cost while providing solutions for the problem. Experiments show that our algorithm performs well especially on large datasets with correctness.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑