论文标题
从Skylines和Top-K查询中获得最好的
Getting the best from skylines and top-k queries
论文作者
论文摘要
Top-K和Skylines是两种重要的技术，可用于从集合中提取最佳对象。两种方法都有众所周知的利弊：天际线查询的一个很大的限制是无法控制产出的基数，并且难以指定属性之间的权衡，而排名查询则允许。另一方面，排名的用法意味着排名函数需要由用户指定并放弃Skylines的简单性。灵活/限制的天际线提出了一种解决此问题的新方法，结合了两种技术的最佳特征，利用了新的优势灵活关系。
Top-k and skylines are two important techniques that can be used to extract the best objects from a set. Both the approaches have well-known pros and cons: a quite big limitation of skyline queries is the impossibility to control the cardinality of the output and the difficulty in specifying a trade-off among attributes, whereas the ranking queries allow so. On the other hand, the usage of ranking implies that ranking functions need to be specified by users and renouncing the simplicity of skylines. Flexible/ restricted skylines present a new approach to tackle this problem, combining the best characteristics of both techniques making use of a new flexible relation of dominance.
