摘要: Skyline queries compute the set of Pareto-optimal tuples in a relation, ie those that are not dominated by any other tuple same relation. Although several algorithms have been proposed for efficiently evaluating skyline queries, they either require to extend relational server with specialized access methods (which is always feasible) or perform dominance tests on all order determine result. In this paper we introduce SaLSa (Sort and Limit algorithm), which exploits sorting machinery engine so only subset them needs be examined computing This makes particularly attractive when executed top systems do understand semantics logic runs clients limited power and/or bandwidth.