The Hexagon algorithm for Pareto preference queries

  • Database queries expressing user preferences have been found to be crucial for personalized applications. Such preference queries, in particular Pareto preference queries, pose new optimization challenges for efficient evaluation. So far however, all known generic Pareto evaluation algorithms suffer from non-linear worst case runtimes. Here we present the first generic algorithm, called Hexagon, with linear worst case complexity for any data distribution under certain reasonable assumptions. In addition, our performance investigations provide evidence that Hexagon also beats competing Block-Nested-Loop style algorithms in the average case. Therefore Hexagon has the potential to become one key algorithm in each preference query optimizer's repertoire.

Export metadata


Number of document requests

Additional Services

Share in Twitter Search Google Scholar
Author:Timotheus PreisingerGND, Werner KießlingGND
Frontdoor URL
Parent Title (English):3rd Multidisciplinary Workshop on Advances in Preference Handling in conjunction with VLDB 2007, Vienna, Austria, September 2007
Type:Conference Proceeding
Year of first Publication:2007
Release Date:2020/03/06
Institutes:Fakultät für Angewandte Informatik
Fakultät für Angewandte Informatik / Institut für Informatik
Fakultät für Angewandte Informatik / Institut für Informatik / Lehrstuhl für Datenbanken und Informationssysteme