Welcome to the InfoSci Platform
Reference Hub9
Parallel Skyline Computation Exploiting the Lattice Structure

Parallel Skyline Computation Exploiting the Lattice Structure

Markus Endres, Werner Kießling
Copyright: © 2015 |Volume: 26 |Issue: 4 |Pages: 26
ISSN: 1063-8016|EISSN: 1533-8010|EISBN13: 9781466675520|DOI: 10.4018/JDM.2015100102
Cite Article Cite Article

MLA

Endres, Markus, and Werner Kießling. "Parallel Skyline Computation Exploiting the Lattice Structure." JDM vol.26, no.4 2015: pp.18-43. http://doi.org/10.4018/JDM.2015100102

APA

Endres, M. & Kießling, W. (2015). Parallel Skyline Computation Exploiting the Lattice Structure. Journal of Database Management (JDM), 26(4), 18-43. http://doi.org/10.4018/JDM.2015100102

Chicago

Endres, Markus, and Werner Kießling. "Parallel Skyline Computation Exploiting the Lattice Structure," Journal of Database Management (JDM) 26, no.4: 18-43. http://doi.org/10.4018/JDM.2015100102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The problem of Skyline computation has attracted considerable research attention in the last decade. A Skyline query selects those tuples from a dataset that are optimal with respect to a set of designated preference attributes. Since multicore processors are going mainstream, it has become imperative to develop parallel algorithms, which fully exploit the advantages of such modern hardware architectures. In this paper, the authors present high-performance parallel Skyline algorithms based on the lattice structure generated by a Skyline query. For this, they propose different evaluation strategies and compare several data structures for the parallel evaluation of Skyline queries. The authors present novel optimization techniques for lattice based Skyline algorithms based on pruning and removing one unrestricted attribute domain. They demonstrate through comprehensive experiments on synthetic and real datasets that their new algorithms outperform state-of-the-art multicore Skyline techniques for low-cardinality domains. The authors' algorithms have linear runtime complexity and fully play on modern hardware architectures.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.