Efficient distance-based representative skyline computation in 2D space

Rui Mao, Taotao Cai, Rong-Hua Li, Jeffrey Xu Yu, Jianxin Li

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Representative skyline computation is a fundamental issue in database area, which has attracted much attention in recent years. A notable definition of representative skyline is the distance-based representative skyline (DBRS). Given an integer k, a DBRS includes k representative skyline points that aims at minimizing the maximal distance between a non-representative skyline point and its nearest representative. In the 2D space, the state-of-the-art algorithm to compute the DBRS is based on dynamic programming (DP) which takes O(km2) time complexity, where m is the number of skyline points. Clearly, such a DP-based algorithm cannot be used for handling large scale datasets due to the quadratic time cost. To overcome this problem, in this paper, we propose a new approximate algorithm called ARS, and a new exact algorithm named PSRS, based on a carefully-designed parametric search technique. We show that the ARS algorithm can guarantee a solution that is at mostlarger than the optimal solution. The proposed ARS and PSRS algorithms run in and O(k2 log3m) time respectively, where T is no more than the maximal distance between any two skyline points. We also propose an improved exact algorithm, called PSRS+, based on an effective lower and upper bounding technique. We conduct extensive experimental studies over both synthetic and real-world datasets, and the results demonstrate the efficiency and effectiveness of the proposed algorithms. © 2016, Springer Science+Business Media New York.
Original languageEnglish
Pages (from-to)621-638
Number of pages18
JournalWorld Wide Web
Volume20
Issue number4
DOIs
Publication statusPublished - 2017

Fingerprint

Dynamic programming
Costs
Industry

Cite this

Mao, Rui ; Cai, Taotao ; Li, Rong-Hua ; Yu, Jeffrey Xu ; Li, Jianxin. / Efficient distance-based representative skyline computation in 2D space. In: World Wide Web. 2017 ; Vol. 20, No. 4. pp. 621-638.
@article{cb9afe66f3224418bdc2c4c9f38a758e,
title = "Efficient distance-based representative skyline computation in 2D space",
abstract = "Representative skyline computation is a fundamental issue in database area, which has attracted much attention in recent years. A notable definition of representative skyline is the distance-based representative skyline (DBRS). Given an integer k, a DBRS includes k representative skyline points that aims at minimizing the maximal distance between a non-representative skyline point and its nearest representative. In the 2D space, the state-of-the-art algorithm to compute the DBRS is based on dynamic programming (DP) which takes O(km2) time complexity, where m is the number of skyline points. Clearly, such a DP-based algorithm cannot be used for handling large scale datasets due to the quadratic time cost. To overcome this problem, in this paper, we propose a new approximate algorithm called ARS, and a new exact algorithm named PSRS, based on a carefully-designed parametric search technique. We show that the ARS algorithm can guarantee a solution that is at mostlarger than the optimal solution. The proposed ARS and PSRS algorithms run in and O(k2 log3m) time respectively, where T is no more than the maximal distance between any two skyline points. We also propose an improved exact algorithm, called PSRS+, based on an effective lower and upper bounding technique. We conduct extensive experimental studies over both synthetic and real-world datasets, and the results demonstrate the efficiency and effectiveness of the proposed algorithms. {\circledC} 2016, Springer Science+Business Media New York.",
author = "Rui Mao and Taotao Cai and Rong-Hua Li and Yu, {Jeffrey Xu} and Jianxin Li",
year = "2017",
doi = "10.1007/s11280-016-0406-0",
language = "English",
volume = "20",
pages = "621--638",
journal = "World Wide Web",
issn = "1386-145X",
publisher = "Springer",
number = "4",

}

Efficient distance-based representative skyline computation in 2D space. / Mao, Rui; Cai, Taotao; Li, Rong-Hua; Yu, Jeffrey Xu; Li, Jianxin.

In: World Wide Web, Vol. 20, No. 4, 2017, p. 621-638.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient distance-based representative skyline computation in 2D space

AU - Mao, Rui

AU - Cai, Taotao

AU - Li, Rong-Hua

AU - Yu, Jeffrey Xu

AU - Li, Jianxin

PY - 2017

Y1 - 2017

N2 - Representative skyline computation is a fundamental issue in database area, which has attracted much attention in recent years. A notable definition of representative skyline is the distance-based representative skyline (DBRS). Given an integer k, a DBRS includes k representative skyline points that aims at minimizing the maximal distance between a non-representative skyline point and its nearest representative. In the 2D space, the state-of-the-art algorithm to compute the DBRS is based on dynamic programming (DP) which takes O(km2) time complexity, where m is the number of skyline points. Clearly, such a DP-based algorithm cannot be used for handling large scale datasets due to the quadratic time cost. To overcome this problem, in this paper, we propose a new approximate algorithm called ARS, and a new exact algorithm named PSRS, based on a carefully-designed parametric search technique. We show that the ARS algorithm can guarantee a solution that is at mostlarger than the optimal solution. The proposed ARS and PSRS algorithms run in and O(k2 log3m) time respectively, where T is no more than the maximal distance between any two skyline points. We also propose an improved exact algorithm, called PSRS+, based on an effective lower and upper bounding technique. We conduct extensive experimental studies over both synthetic and real-world datasets, and the results demonstrate the efficiency and effectiveness of the proposed algorithms. © 2016, Springer Science+Business Media New York.

AB - Representative skyline computation is a fundamental issue in database area, which has attracted much attention in recent years. A notable definition of representative skyline is the distance-based representative skyline (DBRS). Given an integer k, a DBRS includes k representative skyline points that aims at minimizing the maximal distance between a non-representative skyline point and its nearest representative. In the 2D space, the state-of-the-art algorithm to compute the DBRS is based on dynamic programming (DP) which takes O(km2) time complexity, where m is the number of skyline points. Clearly, such a DP-based algorithm cannot be used for handling large scale datasets due to the quadratic time cost. To overcome this problem, in this paper, we propose a new approximate algorithm called ARS, and a new exact algorithm named PSRS, based on a carefully-designed parametric search technique. We show that the ARS algorithm can guarantee a solution that is at mostlarger than the optimal solution. The proposed ARS and PSRS algorithms run in and O(k2 log3m) time respectively, where T is no more than the maximal distance between any two skyline points. We also propose an improved exact algorithm, called PSRS+, based on an effective lower and upper bounding technique. We conduct extensive experimental studies over both synthetic and real-world datasets, and the results demonstrate the efficiency and effectiveness of the proposed algorithms. © 2016, Springer Science+Business Media New York.

U2 - 10.1007/s11280-016-0406-0

DO - 10.1007/s11280-016-0406-0

M3 - Article

VL - 20

SP - 621

EP - 638

JO - World Wide Web

JF - World Wide Web

SN - 1386-145X

IS - 4

ER -