IDSA: an efficient algorithm for skyline queries computation on dynamic and incomplete data with changing states

Gulzar, Yonis and Alwan, Ali Amer and Ibrahim, Hamidah and Turaev, Sherzod and Wani, Sharyar and Soomro, Arjumand Bano and Hamid, Yasir (2021) IDSA: an efficient algorithm for skyline queries computation on dynamic and incomplete data with changing states. IEEE Access, 9. pp. 57291-57310. ISSN 2169-3536 E-ISSN 2169-3536

	PDF (SCOPUS) - Supplemental Material Restricted to Registered users only Download (570kB) | Request a copy
	PDF - Published Version Restricted to Registered users only Download (1MB) | Request a copy

Abstract

Skyline queries have been widely used as an effective query tool in many contemporary database applications. The main concept of skyline queries relies on retrieving the non-dominated tuples in the database which are known skylines. In most database applications, the contents of the databases are dynamic due to the continuous changes made towards the database. Typically, the changes in the contents of the database occur through data manipulation operations (INSERT and/or UPDATE). Performing these operations on the database results in invalidating the most recent skylines before changes are made on the database. Furthermore, the presence of incomplete data in databases becomes frequent phenomena in recent database applications. Data incompleteness causes several challenges on skyline queries such as losing the transitivity property of the skyline technique and the test dominance process between tuples being cyclic. Reapplying skyline technique on the entire updated incomplete database to determine the new skylines is unwise due to the exhaustive pairwise comparisons. Thus, this paper proposes an approach, named Incomplete Dynamic Skyline Algorithm (IDSA) which attempts to determine the skylines on dynamic and incomplete databases. Two optimization techniques have been incorporated in IDSA, namely: pruning and selecting superior local skylines. The pruning process attempts to exploit the derived skylines before the INSERT/UPDATE operation made on the database to identify the new skylines. Moreover, selecting superior local skylines process assists in further eliminating the remaining non-skylines from further processing. These two optimization techniques lead to a large reduction in the number of domination tests due to avoiding re-computing of skylines over the entire updated database to derive the new skylines. Extensive experiments have been accomplished on both real and synthetic datasets, and the results demonstrate that IDSA outperforms the existing solutions in terms of the number of domination tests and the processing time of the skyline operation.

Item Type:	Article (Journal)
Additional Information:	7094/89495
Uncontrolled Keywords:	Dynamic database, incomplete database, pairwise comparison, skyline queries
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science Q Science > QA Mathematics > QA76 Computer software
Kulliyyahs/Centres/Divisions/Institutes (Can select more than one option. Press CONTROL button):	Kulliyyah of Information and Communication Technology Kulliyyah of Information and Communication Technology Kulliyyah of Information and Communication Technology > Department of Computer Science Kulliyyah of Information and Communication Technology > Department of Computer Science
Depositing User:	DR. ALI A. ALWAN AL-JUBOORI
Date Deposited:	22 Apr 2021 14:47
Last Modified:	17 Jun 2021 15:21
URI:	http://irep.iium.edu.my/id/eprint/89495

Actions (login required)

View Item