Skip to main navigation Skip to search Skip to main content

Efficient Computation of Skyline Queries on Incomplete Dynamic Data

  • Hongzhi Wang*
  • , Shengjun Yin
  • , Ming Sun
  • , Ye Wang
  • , Hepeng Wang
  • , Jianzhong Li
  • , Hong Gao
  • *Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Skyline query is a typical preference query method. Due to its capacity of extracting interesting information from multi-dimensional datasets abided by multiple criterions, the skyline query has been extensively studied. All of the existing studies assume that the data are complete and available, which may not hold in many real applications because of device exception, privacy protection and other reasons. Datasets with missing attribute values or missing tuples are called incomplete datasets. In this paper, we mainly discussed the case of incomplete attribute values in a dynamic dataset. First, considering the dynamic dataset, we propose the kISkyline algorithm based on the traditional sliding window model with a split bucket strategy. We then propose the sISkyline algorithm based on a real point, virtual point, and shadow point with a split bucket strategy along with the traditional sliding window model. Finally, simulation results are provided to demonstrate the feasibility and effectiveness of these two new algorithms.

Original languageEnglish
Article number8467522
Pages (from-to)52741-52753
Number of pages13
JournalIEEE Access
Volume6
DOIs
StatePublished - 18 Sep 2018

Keywords

  • Data engineering

Fingerprint

Dive into the research topics of 'Efficient Computation of Skyline Queries on Incomplete Dynamic Data'. Together they form a unique fingerprint.

Cite this