Home // DBKDA 2015, The Seventh International Conference on Advances in Databases, Knowledge, and Data Applications // View article
Authors:
Markus Endres
Timotheus Preisinger
Keywords: Skyline; Preferences; Multi-level; Top-k
Abstract:
A Skyline query selects those tuples from a dataset that are optimal with respect to a set of designated preference attributes. However, in some cases, not only the Pareto frontier is of interest, but also the stratum behind the Skyline. In this paper, we extend the definition of the Skyline to form multi-level Skyline sets. We propose an algorithm for multi-level Skyline computation and apply this concept for efficient top-k Skyline evaluation. Given a dataset, a top-k Skyline query returns the k most interesting elements of the Skyline query based on some kind of user-defined preference. We demonstrate through extensive experimentation on synthetic and real datasets that our algorithm can result in a significant performance advantage over existing techniques.
Pages: 141 to 146
Copyright: Copyright (c) IARIA, 2015
Publication date: May 24, 2015
Published in: conference
ISSN: 2308-4332
ISBN: 978-1-61208-408-4
Location: Rome, Italy
Dates: from May 24, 2015 to May 29, 2015