Skip to Main content Skip to Navigation
Conference papers

Efficient Skyline Computation in High-Dimensionality Domains

Abstract : We present a dimension indexing based algorithm for skyline computation. We first show that the dominance tests required to determine a skyline tuple can be sufficiently bounded to a subset of the current skyline, and then propose the algorithm SDI, of which the time complexity is better than the best known algorithm in high-dimensionality domains with reasonably low cardinality. Our performance evaluation on synthetic and real datasets shows that SDI outperforms the state-of-the-art skyline algorithm in both low-dimensionality and high-dimensionality domains.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02530320
Contributor : Dominique Li <>
Submitted on : Thursday, April 2, 2020 - 7:34:25 PM
Last modification on : Wednesday, June 17, 2020 - 3:26:38 AM

File

paper_362.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Rui Liu, Dominique Li. Efficient Skyline Computation in High-Dimensionality Domains. EDBT 2020, Mar 2020, Copenhagen, Denmark. ⟨10.5441/002/edbt.2020.57⟩. ⟨hal-02530320⟩

Share

Metrics

Record views

35

Files downloads

53