DeltaSky

Optimal maintenance of skyline deletions without exclusive dominance region generation

Ping Wu, Divyakant Agrawal, Ömer Eǧecioǧlu, Amr El Abbadi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

42 Citations (Scopus)

Abstract

This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline query computation, an equally important but largely unanswered issue is on the incremental maintenance for skyline deletions. Previous work suggested the use of the so called exclusive dominance region (EDR) to achieve optimal I/O performance for deletion maintenance. However, the shape of an EDR becomes extremely complex in higher dimensions, and algorithms for its computation have not been developed. We derive a systematic way to decompose a d-dimensional EDR into a collection of hyper-rectangles. We show that the number of such hyper-rectangles is O(md), where m is the current skyline result size. We then propose a novel algorithm Del taSky which determines whether an intermediate R-tree MBR intersects with the EDR without explicitly calculating the EDR itself. This reduces the worse case complexity of the EDR intersection check from O(md) to O(md). Thus DeltaSky helps the branch and bound skyline algorithm achieve I/O optimality for deletion maintenance by finding only the newly appeared skyline points after the deletion. We discuss implementation issues and show that DeltaSky can be efficiently implemented using one extra B-Tree. Moreover, we propose two optimization techniques which further reduce the average cost in practice. Extensive experiments demonstrate that DeltaSky achieves orders of magnitude performance gain over alternative solutions.

Original languageEnglish
Title of host publicationProceedings - International Conference on Data Engineering
Pages486-495
Number of pages10
DOIs
Publication statusPublished - 24 Sep 2007
Externally publishedYes
Event23rd International Conference on Data Engineering, ICDE 2007 - Istanbul, Turkey
Duration: 15 Apr 200720 Apr 2007

Other

Other23rd International Conference on Data Engineering, ICDE 2007
CountryTurkey
CityIstanbul
Period15/4/0720/4/07

Fingerprint

Costs
Experiments

ASJC Scopus subject areas

  • Software
  • Engineering(all)
  • Engineering (miscellaneous)

Cite this

Wu, P., Agrawal, D., Eǧecioǧlu, Ö., & El Abbadi, A. (2007). DeltaSky: Optimal maintenance of skyline deletions without exclusive dominance region generation. In Proceedings - International Conference on Data Engineering (pp. 486-495). [4221697] https://doi.org/10.1109/ICDE.2007.367894

DeltaSky : Optimal maintenance of skyline deletions without exclusive dominance region generation. / Wu, Ping; Agrawal, Divyakant; Eǧecioǧlu, Ömer; El Abbadi, Amr.

Proceedings - International Conference on Data Engineering. 2007. p. 486-495 4221697.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wu, P, Agrawal, D, Eǧecioǧlu, Ö & El Abbadi, A 2007, DeltaSky: Optimal maintenance of skyline deletions without exclusive dominance region generation. in Proceedings - International Conference on Data Engineering., 4221697, pp. 486-495, 23rd International Conference on Data Engineering, ICDE 2007, Istanbul, Turkey, 15/4/07. https://doi.org/10.1109/ICDE.2007.367894
Wu P, Agrawal D, Eǧecioǧlu Ö, El Abbadi A. DeltaSky: Optimal maintenance of skyline deletions without exclusive dominance region generation. In Proceedings - International Conference on Data Engineering. 2007. p. 486-495. 4221697 https://doi.org/10.1109/ICDE.2007.367894
Wu, Ping ; Agrawal, Divyakant ; Eǧecioǧlu, Ömer ; El Abbadi, Amr. / DeltaSky : Optimal maintenance of skyline deletions without exclusive dominance region generation. Proceedings - International Conference on Data Engineering. 2007. pp. 486-495
@inproceedings{16bc7c5f99dc40e1856421317915db82,
title = "DeltaSky: Optimal maintenance of skyline deletions without exclusive dominance region generation",
abstract = "This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline query computation, an equally important but largely unanswered issue is on the incremental maintenance for skyline deletions. Previous work suggested the use of the so called exclusive dominance region (EDR) to achieve optimal I/O performance for deletion maintenance. However, the shape of an EDR becomes extremely complex in higher dimensions, and algorithms for its computation have not been developed. We derive a systematic way to decompose a d-dimensional EDR into a collection of hyper-rectangles. We show that the number of such hyper-rectangles is O(md), where m is the current skyline result size. We then propose a novel algorithm Del taSky which determines whether an intermediate R-tree MBR intersects with the EDR without explicitly calculating the EDR itself. This reduces the worse case complexity of the EDR intersection check from O(md) to O(md). Thus DeltaSky helps the branch and bound skyline algorithm achieve I/O optimality for deletion maintenance by finding only the newly appeared skyline points after the deletion. We discuss implementation issues and show that DeltaSky can be efficiently implemented using one extra B-Tree. Moreover, we propose two optimization techniques which further reduce the average cost in practice. Extensive experiments demonstrate that DeltaSky achieves orders of magnitude performance gain over alternative solutions.",
author = "Ping Wu and Divyakant Agrawal and {\"O}mer Eǧecioǧlu and {El Abbadi}, Amr",
year = "2007",
month = "9",
day = "24",
doi = "10.1109/ICDE.2007.367894",
language = "English",
isbn = "1424408032",
pages = "486--495",
booktitle = "Proceedings - International Conference on Data Engineering",

}

TY - GEN

T1 - DeltaSky

T2 - Optimal maintenance of skyline deletions without exclusive dominance region generation

AU - Wu, Ping

AU - Agrawal, Divyakant

AU - Eǧecioǧlu, Ömer

AU - El Abbadi, Amr

PY - 2007/9/24

Y1 - 2007/9/24

N2 - This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline query computation, an equally important but largely unanswered issue is on the incremental maintenance for skyline deletions. Previous work suggested the use of the so called exclusive dominance region (EDR) to achieve optimal I/O performance for deletion maintenance. However, the shape of an EDR becomes extremely complex in higher dimensions, and algorithms for its computation have not been developed. We derive a systematic way to decompose a d-dimensional EDR into a collection of hyper-rectangles. We show that the number of such hyper-rectangles is O(md), where m is the current skyline result size. We then propose a novel algorithm Del taSky which determines whether an intermediate R-tree MBR intersects with the EDR without explicitly calculating the EDR itself. This reduces the worse case complexity of the EDR intersection check from O(md) to O(md). Thus DeltaSky helps the branch and bound skyline algorithm achieve I/O optimality for deletion maintenance by finding only the newly appeared skyline points after the deletion. We discuss implementation issues and show that DeltaSky can be efficiently implemented using one extra B-Tree. Moreover, we propose two optimization techniques which further reduce the average cost in practice. Extensive experiments demonstrate that DeltaSky achieves orders of magnitude performance gain over alternative solutions.

AB - This paper addresses the problem of efficient maintenance of a materialized skyline view in response to skyline removals. While there has been significant progress on skyline query computation, an equally important but largely unanswered issue is on the incremental maintenance for skyline deletions. Previous work suggested the use of the so called exclusive dominance region (EDR) to achieve optimal I/O performance for deletion maintenance. However, the shape of an EDR becomes extremely complex in higher dimensions, and algorithms for its computation have not been developed. We derive a systematic way to decompose a d-dimensional EDR into a collection of hyper-rectangles. We show that the number of such hyper-rectangles is O(md), where m is the current skyline result size. We then propose a novel algorithm Del taSky which determines whether an intermediate R-tree MBR intersects with the EDR without explicitly calculating the EDR itself. This reduces the worse case complexity of the EDR intersection check from O(md) to O(md). Thus DeltaSky helps the branch and bound skyline algorithm achieve I/O optimality for deletion maintenance by finding only the newly appeared skyline points after the deletion. We discuss implementation issues and show that DeltaSky can be efficiently implemented using one extra B-Tree. Moreover, we propose two optimization techniques which further reduce the average cost in practice. Extensive experiments demonstrate that DeltaSky achieves orders of magnitude performance gain over alternative solutions.

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

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

U2 - 10.1109/ICDE.2007.367894

DO - 10.1109/ICDE.2007.367894

M3 - Conference contribution

SN - 1424408032

SN - 9781424408030

SP - 486

EP - 495

BT - Proceedings - International Conference on Data Engineering

ER -