Scalable skyline computation using a balanced pivot selection technique

Jongwuk Lee, Seung Won Hwang

Research output: Contribution to journalArticle

35 Citations (Scopus)

Abstract

Skyline queries have recently received considerable attention as an alternative decision-making operator in the database community. The conventional skyline algorithms have primarily focused on optimizing the dominance of points in order to remove non-skyline points as efficiently as possible, but have neglected to take into account the incomparability of points in order to bypass unnecessary comparisons. To design a scalable skyline algorithm, we first analyze a cost model that copes with both dominance and incomparability, and develop a novel technique to select a cost-optimal point, called a pivot point, that minimizes the number of comparisons in point-based space partitioning. We then implement the proposed pivot point selection technique in the existing sorting- and partitioning-based algorithms. For point insertions/deletions, we also discuss how to maintain the current skyline using a skytree, derived from recursive point-based space partitioning. Furthermore, we design an efficient greedy algorithm for the k representative skyline using the skytree. Experimental results demonstrate that the proposed algorithms are significantly faster than the state-of-the-art algorithms.

Original languageEnglish
Pages (from-to)1-21
Number of pages21
JournalInformation Systems
Volume39
Issue number1
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Sorting
Costs
Decision making

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Hardware and Architecture

Cite this

@article{4bbb7bb7f7f64eccbc705e451950e3c5,
title = "Scalable skyline computation using a balanced pivot selection technique",
abstract = "Skyline queries have recently received considerable attention as an alternative decision-making operator in the database community. The conventional skyline algorithms have primarily focused on optimizing the dominance of points in order to remove non-skyline points as efficiently as possible, but have neglected to take into account the incomparability of points in order to bypass unnecessary comparisons. To design a scalable skyline algorithm, we first analyze a cost model that copes with both dominance and incomparability, and develop a novel technique to select a cost-optimal point, called a pivot point, that minimizes the number of comparisons in point-based space partitioning. We then implement the proposed pivot point selection technique in the existing sorting- and partitioning-based algorithms. For point insertions/deletions, we also discuss how to maintain the current skyline using a skytree, derived from recursive point-based space partitioning. Furthermore, we design an efficient greedy algorithm for the k representative skyline using the skytree. Experimental results demonstrate that the proposed algorithms are significantly faster than the state-of-the-art algorithms.",
author = "Jongwuk Lee and Hwang, {Seung Won}",
year = "2014",
month = "1",
day = "1",
doi = "10.1016/j.is.2013.05.005",
language = "English",
volume = "39",
pages = "1--21",
journal = "Information Systems",
issn = "0306-4379",
publisher = "Elsevier Limited",
number = "1",

}

Scalable skyline computation using a balanced pivot selection technique. / Lee, Jongwuk; Hwang, Seung Won.

In: Information Systems, Vol. 39, No. 1, 01.01.2014, p. 1-21.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Scalable skyline computation using a balanced pivot selection technique

AU - Lee, Jongwuk

AU - Hwang, Seung Won

PY - 2014/1/1

Y1 - 2014/1/1

N2 - Skyline queries have recently received considerable attention as an alternative decision-making operator in the database community. The conventional skyline algorithms have primarily focused on optimizing the dominance of points in order to remove non-skyline points as efficiently as possible, but have neglected to take into account the incomparability of points in order to bypass unnecessary comparisons. To design a scalable skyline algorithm, we first analyze a cost model that copes with both dominance and incomparability, and develop a novel technique to select a cost-optimal point, called a pivot point, that minimizes the number of comparisons in point-based space partitioning. We then implement the proposed pivot point selection technique in the existing sorting- and partitioning-based algorithms. For point insertions/deletions, we also discuss how to maintain the current skyline using a skytree, derived from recursive point-based space partitioning. Furthermore, we design an efficient greedy algorithm for the k representative skyline using the skytree. Experimental results demonstrate that the proposed algorithms are significantly faster than the state-of-the-art algorithms.

AB - Skyline queries have recently received considerable attention as an alternative decision-making operator in the database community. The conventional skyline algorithms have primarily focused on optimizing the dominance of points in order to remove non-skyline points as efficiently as possible, but have neglected to take into account the incomparability of points in order to bypass unnecessary comparisons. To design a scalable skyline algorithm, we first analyze a cost model that copes with both dominance and incomparability, and develop a novel technique to select a cost-optimal point, called a pivot point, that minimizes the number of comparisons in point-based space partitioning. We then implement the proposed pivot point selection technique in the existing sorting- and partitioning-based algorithms. For point insertions/deletions, we also discuss how to maintain the current skyline using a skytree, derived from recursive point-based space partitioning. Furthermore, we design an efficient greedy algorithm for the k representative skyline using the skytree. Experimental results demonstrate that the proposed algorithms are significantly faster than the state-of-the-art algorithms.

UR - http://www.scopus.com/inward/record.url?scp=84883163755&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84883163755&partnerID=8YFLogxK

U2 - 10.1016/j.is.2013.05.005

DO - 10.1016/j.is.2013.05.005

M3 - Article

AN - SCOPUS:84883163755

VL - 39

SP - 1

EP - 21

JO - Information Systems

JF - Information Systems

SN - 0306-4379

IS - 1

ER -