TY - JOUR
T1 - The σ-neighborhood skyline queries
AU - Chen, Yi Chung
AU - Lee, Chiang
N1 - Publisher Copyright:
© 2015 Elsevier Inc.
PY - 2015/11/20
Y1 - 2015/11/20
N2 - Skyline queries have recently attracted considerable attention for their ability to return data points from a given dataset that are not dominated by any other points. This study extends the concept of skyline queries in the development of a σ-neighborhood skyline query (σ-N skyline query). In contrast to previous methods, the σ-N skyline query finds skyline points and points that are similar, i.e., close to the skyline points. The σ-N skyline points are useful to the user if a skyline point, compared to its σ-N skyline point, is less competitive. In applications such as decision making, market analysis, and business planning, σ-N skyline can provide more flexible answers. This study defines this problem and proposes a new index tree and efficient algorithms to resolve the problem. We conducted a set of simulations to demonstrate the effectiveness and efficiency of the proposed algorithm.
AB - Skyline queries have recently attracted considerable attention for their ability to return data points from a given dataset that are not dominated by any other points. This study extends the concept of skyline queries in the development of a σ-neighborhood skyline query (σ-N skyline query). In contrast to previous methods, the σ-N skyline query finds skyline points and points that are similar, i.e., close to the skyline points. The σ-N skyline points are useful to the user if a skyline point, compared to its σ-N skyline point, is less competitive. In applications such as decision making, market analysis, and business planning, σ-N skyline can provide more flexible answers. This study defines this problem and proposes a new index tree and efficient algorithms to resolve the problem. We conducted a set of simulations to demonstrate the effectiveness and efficiency of the proposed algorithm.
UR - http://www.scopus.com/inward/record.url?scp=84940028183&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84940028183&partnerID=8YFLogxK
U2 - 10.1016/j.ins.2015.06.015
DO - 10.1016/j.ins.2015.06.015
M3 - Article
AN - SCOPUS:84940028183
SN - 0020-0255
VL - 322
SP - 92
EP - 114
JO - Information Sciences
JF - Information Sciences
M1 - 11609
ER -