x-关系模型下的快速概率排序
Fast Probabilistic Ranking under x-Relation Model
摘要:
在可能世界语义下,基于得分和概率相互作用的概率top-k查询成为同时考虑得分和不确定性的重要研究课题。在文献中,提出了许多不同的概率top-k查询。几乎所有这些都需要计算元组t_i在整个可能世界集合中排名第j位的概率。这种计算的成本是主要成本,称为O(kn^2),其中n是数据集的大小。在本文中,我们提出了一个新的算法,计算这样的概率在O(kn)。
英文摘要:
The probabilistic top-k queries based on the interplay of score and probability, under the possible worlds semantic, become an important research issue that considers both score and uncertainty on the same basis. In the literature, many different probabilistic top-k queries are proposed. Almost all of them need to compute the probability of a tuple t_i to be ranked at the j-th position across the entire set of possible worlds. The cost of such computing is the dominant cost and is known as O(kn^2), where n is the size of dataset. In this paper, we propose a new novel algorithm that computes such probability in O(kn).
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。