By Topic

Computing Large Skylines over Few Dimensions: The Curse of Anti-correlation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Köhler, H. ; Univ. of Queensland, Brisbane, QLD, Australia ; Jing Yang

The skyline of a set P of multi-dimensional points (tuples) consists of those points in P for which no clearly better point in P exists, using component-wise comparison on domains of interest. While many algorithms have been proposed for efficient computation of skylines, virtually all of them fail to terminate quickly when the skyline set is large, typically displaying quadratic complexity. Large skyline can occur even if the number of dimensions is low, but where the data set is anti-correlated - a common situation in practice. In this paper we propose a new approach for computing large skylines quickly when the dimensionality is low. We show that for two domains of interest, skyline computation can be performed in linear time (plus near-linear time for index construction if not done beforehand), and that for three dimensions this is possible in near-linear time, regardless of skyline size.

Published in:

Web Conference (APWEB), 2010 12th International Asia-Pacific

Date of Conference:

6-8 April 2010