Efficient processing of top-k queries is a crucial requirement in many interactive
environments that involve massive amounts of data. In particular, efficient top-k processing …

When faced with a database containing millions of tuples, a user may be only interested in a
(typically much) smaller representative subset. Recently, a query called the regret …

The skyline of a set of d-dimensional points contains the points that are not dominated by
any other point on all dimensions. Skyline computation has recently received considerable …

The skyline of ad-dimensional dataset contains the points that are not dominated by any
other point on all dimensions. Skyline computation has recently received considerable …

Items from a database are often ranked based on a combination of criteria. The weight given
to each criterion in the combination can greatly affect the fairness of the produced ranking …

Given two spatial datasets P (eg, facilities) and Q (queries), an aggregate nearest neighbor
(ANN) query retrieves the point (s) of P with the smallest aggregate distance (s) to points in …

Users often need to optimize the selection of objects by appropriately weighting the
importance of multiple object attributes. Such optimization problems appear often in …

Given a dataset P and a preference function f, a top-k query retrieves the k tuples in P with
the highest scores according to f. Even though the problem is well-studied in conventional …

This paper introduces RankSQL, a system that provides a systematic and principled
framework to support efficient evaluations of ranking (top-k) queries in relational database …

The two most common paradigms to identify records of preference in a multi-objective
setting rely either on dominance (eg, the skyline operator) or on a utility function defined …