顺序约束下未知值的Top-k查询(扩展版)
Top-k Querying of Unknown Values under Order Constraints (Extended Version)
摘要:
许多实际情况下,有必要评估top-k查询的数据项与部分未知的值。本文考虑了一种设置,其中的值是从一个数值域,并给出了一些偏序约束已知和未知的值:在这些约束下,我们假设所有可能的世界是同样可能的。我们的工作是第一个提出一个原则性的计划,以获得在此设置中的未知项目的值分布和期望值,通过从已知的未知值插值计算估计的top-k结果的目标。我们研究了这个一般任务的复杂性,并显示严格的复杂性界限,证明了这个问题是棘手的,但可以跟踪近似。然后,我们考虑的情况下,树形偏序,我们展示了一个建设性的PTIME解决方案。我们还将我们的问题设置与不确定数据上的其他top-k定义进行了比较。
英文摘要:
Many practical scenarios make it necessary to evaluate top-k queries over data items with partially unknown values. This paper considers a setting where the values are taken from a numerical domain, and where some partial order constraints are given over known and unknown values: under these constraints, we assume that all possible worlds are equally likely. Our work is the first to propose a principled scheme to derive the value distributions and expected values of unknown items in this setting, with the goal of computing estimated top-k results by interpolating the unknown values from the known ones. We study the complexity of this general task, and show tight complexity bounds, proving that the problem is intractable, but can be tractably approximated. We then consider the case of tree-shaped partial orders, where we show a constructive PTIME solution. We also compare our problem setting to other top-k definitions on uncertain data.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。