Efficient Skyline Computation in High-Dimensionality Domains - Laboratoire d'Informatique Fondamentale et Appliquée de Tours Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

Efficient Skyline Computation in High-Dimensionality Domains

Résumé

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.
Fichier principal
Vignette du fichier
paper_362.pdf (897.77 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02530320 , version 1 (02-04-2020)

Identifiants

Citer

Rui Liu, Dominique H. Li. Efficient Skyline Computation in High-Dimensionality Domains. EDBT 2020, Mar 2020, Copenhagen, Denmark. ⟨10.5441/002/edbt.2020.57⟩. ⟨hal-02530320⟩
212 Consultations
71 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More