Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality

Efficient k-Regret Query Algorithm with Restriction-free Bound for any Dimensionality
复制标题

任意维度无限制边界的高效 k-Regret 查询算法

DOI:
10.1145/3183713.3196903
复制
发表时间:
2018-05
期刊:
Proceedings of the 2018 International Conference on Management of Data - SIGMOD '18
影响因子:
--
通讯作者:
Ashwin Lall
Ashwin Lall
中科院分区:
其他
文献类型:
--
作者:
Min Xie;Raymond Chi Wing Wong;Jian Li;Cheng Long;Ashwin Lall

文献摘要

参考文献

相似文献

从大型数据库中提取感兴趣的元组是多准则决策中的一个重要问题。文献中提出了两个有代表性的查询:Top-k查询和Skyline查询。Top-k查询要求用户预先指定其效用函数,然后向用户返回k个元组。Skyline查询不需要用户提供任何实用函数,但它不控制返回给用户的元组数量。最近,一种k-遗憾查询被提出并受到了社会各界的关注,因为它不需要用户提供任何效用函数,并且输出大小是可控的,从而避免了top-k查询和Skyline查询的不足。具体地说,它返回最小化称为最大后悔比的标准的k个元组。在本文中,我们给出了k-后悔查询的最大后悔比的下界。此外,我们还提出了一种新的算法SERBLE,它的最大缺失率的上界是渐近最优的,并且对于任何维度都是无限制的,这是文献中最著名的结果。我们进行了大量的实验,结果表明,SPERE算法在k-悔恨查询中的性能要好于现有的方法。
Extracting interesting tuples from a large database is an important problem in multi-criteria decision making. Two representative queries were proposed in the literature: top- k queries and skyline queries. A top- k query requires users to specify their utility functions beforehand and then returns k tuples to the users. A skyline query does not require any utility function from users but it puts no control on the number of tuples returned to users. Recently, a k-regret query was proposed and received attention from the community because it does not require any utility function from users and the output size is controllable, and thus it avoids those deficiencies of top- k queries and skyline queries. Specifically, it returns k tuples that minimize a criterion called the maximum regret ratio . In this paper, we present the lower bound of the maximum regret ratio for the k -regret query. Besides, we propose a novel algorithm, called SPHERE, whose upper bound on the maximum regret ratio is asymptotically optimal and restriction-free for any dimensionality, the best-known result in the literature. We conducted extensive experiments to show that SPHERE performs better than the state-of-the-art methods for the k -regret query.
DOI: 10.1016/j.is.2008.04.004
发表时间: 2009-03
期刊: Inf. Syst.
影响因子: --
作者:
Jongwuk Lee;Gae-won You;Seung-won Hwang
通讯作者: Jongwuk Lee;Gae-won You;Seung-won Hwang
DOI: 10.14778/1920841.1920980
发表时间: 2010-09
影响因子: 2.5
作者:
Danupon Nanongkai;Atish Das Sarma;Ashwin Lall;R. Lipton;Jun Xu
通讯作者: Danupon Nanongkai;Atish Das Sarma;Ashwin Lall;R. Lipton;Jun Xu
DOI: 10.1109/icde.2008.4497568
发表时间: 2008-04
期刊: 2008 IEEE 24th International Conference on Data Engineering
影响因子: --
作者:
Tian Xia;Donghui Zhang;Yufei Tao
通讯作者: Tian Xia;Donghui Zhang;Yufei Tao
DOI: 10.4230/lipics.icdt.2017.11
发表时间: 2017
期刊: Algorithmica
影响因子: 1.1
作者:
Wei Cao;J. Li;Haitao Wang;Kangning Wang;Ruosong Wang;R. C. Wong;Wei Zhan
通讯作者: Wei Cao;J. Li;Haitao Wang;Kangning Wang;Ruosong Wang;R. C. Wong;Wei Zhan
DOI: 10.1109/sfcs.1992.267805
发表时间: 1992-10
期刊: Proceedings., 33rd Annual Symposium on Foundations of Computer Science
影响因子: --
作者:
B. Gärtner
通讯作者: B. Gärtner