Long-established ranking approaches, such as top-k and skyline queries, have been thoroughly discussed and their drawbacks are well acknowledged. New techniques have been developed in recent years that try to combine traditional ones to overcome their limitations. In this paper we focus our attention on some of them: flexible skylines, regret minimization and skyline ranking queries, because, while these new methods are promising and have shown interesting results, a comparison between them is still not available. After a short introduction of each approach, we discuss analogies and differences between them with the advantages and disadvantages of every technique debated.
翻译:长期确立的排名办法,如上K和天线查询,已经得到彻底的讨论,它们的缺点已经得到广泛承认。近年来,已经开发出新的技术,试图将传统技术结合起来,克服其局限性。在本文件中,我们把注意力集中在其中一些方法上:灵活的天线、尽量减少遗憾和天线排序查询,因为这些新方法很有希望并显示出令人感兴趣的结果,但它们之间的比较仍然无法取得。在对每一种方法进行简短介绍之后,我们讨论了它们之间的相似之处和差异,以及所辩论的每一种技术的利弊。